#include<algorithm>
#include<cstdio>
#include<sstream>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<iostream>
#include<fstream>
#include<numeric>
#include<string>
#include<vector>
#include<cstring>
#include<map>
#include<iterator>
#include<deque>
#include<climits>
#include<complex>
#include<string.h>


using namespace std;
//-------------------------------------

#define ll long long
#define ull unsigned long long
#define sc(x) scanf("%lld",&x)
#define sc2(x,y) scanf("%lld%lld",&x,&y)
#define sci(x) scanf("%d",&x)
#define sci2(x,y) scanf("%d%d",&x,&y)

#define rep(i,a,n) for(int i=a;i<n;i++)
#define F(i,n) for(int i=0;i<n;i++)
#define mem(x) memset(x,0,sizeof x)
#define all(x) x.begin(),x.end()
#define xx first
#define yy second
#define inf 999999999999999
#define mkp(x,y) make_pair(x,y)
#define pii pair<ll,ll>
#define pb(x)  push_back(x);

//---------------------------------------

#define MX 200007

#define pi 2*acos(0.00)

#define open       freopen("input.txt","r",stdin)
#define close      freopen ("output.txt","w",stdout)

int main()
{
    ll l, u, v, w, x, y, z, a, b, c, d, e, f, t = 1, tc;
    ll flg, sz, cnt, gt, ans, mx, mn;
    ll m, k, n;
    ll low, hi, md, inp[MX], sm, ff;
    string st,ss;
    F(i,26)
    {
        sc(x),inp[i]=x;
    }
    getchar();
    getline(cin,st);
    sz = st.size();
    ss="";
    ans =0 ;
    F(i,sz)
    {
        if(st[i]==' ')
        {
            z = ss.size();
            b = 0;
//            cout<<ss<<endl;
            F(j,z)
            {
                a = ss[j]-'a';
                b = max(b,inp[a]);
            }
            ans += b*z;

            ss="";
        }
        else ss+=st[i];
    }
    if(ss.size())
    {
        z = ss.size();
        b = 0;
//            cout<<ss<<endl;
        F(j,z)
        {
            a = ss[j]-'a';
            b = max(b,inp[a]);
        }
        ans += b*z;
    }
    cout<<ans<<endl;



    return 0;

}

/*


*/