#include<bits/stdc++.h>
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define mid ((l+r)>>1)
using namespace std;
typedef long long ll;
const int N = 1e5+10,M = 10,INF = 1e9;
template<typename T>void tomin(T& x,T y){x = min(x,y);}
template<typename T>void tomax(T& x,T y){x = max(x,y);}
//
int n,c[M],tc,tp;
char s[N];

int m,sa[N],rk[N*2],oldrk[N*2],cnt[N],tmp[N],tot;
int st[20][N];

int lcp(int i,int j){
    assert(i != j);
    i = rk[i],j = rk[j]; if(i>j)swap(i,j);
    i++; int len = __lg(j-i+1);
    return min(st[len][i],st[len][j-(1<<len)+1]);
}

struct Seg{
    int t[N<<2];
    void pu(int x){ t[x] = min(t[lc(x)],t[rc(x)]); }
    void build(int x,int l,int r){
        if(l==r)return t[x] = sa[l],void();
        build(lc(x),l,mid); build(rc(x),mid+1,r);
        pu(x);
    }
    int qpre(int x,int l,int r,int pos,int v){
        if(l>=pos || t[x]>v)return l-1;
        if(l==r)return l;
        int res = qpre(rc(x),mid+1,r,pos,v); if(res != mid)return res;
        return qpre(lc(x),l,mid,pos,v);
    }
    int qsuf(int x,int l,int r,int pos,int v){
        if(r<=pos || t[x]>v)return r+1;
        if(l==r)return r;
        int res = qsuf(lc(x),l,mid,pos,v); if(res != mid+1)return res;
        return qsuf(rc(x),mid+1,r,pos,v);
    }
}seg;
int chk(int l,int r){
    int len = r-l+1;
    int p = seg.qpre(1,1,n,rk[l],l-len),q = seg.qsuf(1,1,n,rk[l],l-len);
    if(p && lcp(sa[p],l) >= len)return 1;
    if(q!=n+1 && lcp(l,sa[q]) >= len)return 1;
    return 0;
}

void build(){
    m = max(n,150); 
    for(int i=1;i<=n;i++)rk[i] = s[i],cnt[rk[i]]++;
    for(int i=1;i<=m;i++)cnt[i] += cnt[i-1];
    for(int i=n;i>=1;i--)sa[cnt[rk[i]]--] = i;

    for(int w=1;w<n;w<<=1){
        tot = 0; 
        for(int i=n-w+1;i<=n;i++)tmp[++tot] = i;
        for(int i=1;i<=n;i++)if(sa[i] > w)tmp[++tot] = sa[i] - w;
        memset(cnt,0,sizeof cnt);
        for(int i=1;i<=n;i++)cnt[rk[i]]++;
        for(int i=1;i<=m;i++)cnt[i] += cnt[i-1];
        for(int i=n;i>=1;i--)sa[cnt[rk[tmp[i]]]--] = tmp[i];
        memcpy(oldrk,rk,sizeof oldrk);
        rk[sa[1]] = 1;
        for(int i=2;i<=n;i++){
            rk[sa[i]] = rk[sa[i-1]];
            if(oldrk[sa[i]] != oldrk[sa[i-1]] || oldrk[sa[i]+w] != oldrk[sa[i-1]+w])rk[sa[i]]++;
        }
    }
    //
    for(int i=1,j=0;i<=n;i++){
        if(j)j--;
        while(s[i+j] == s[sa[rk[i]-1]+j])j++;
        st[0][rk[i]] = j;
    }
    for(int j=1;j<20;j++)for(int i=1;i<=n-(1<<j)+1;i++)st[j][i] = min(st[j-1][i],st[j-1][i+(1<<(j-1))]);
}

int dp[N],qu[N],hd,rr;
int w(int j){return dp[j] - j*tc;}

int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin>>(s+1); n = strlen(s+1);
    for(int i=0;i<M;i++)cin>>c[i];
    cin>>tc>>tp;

    if(n==1){
        cout<<c[s[1]-'0']; exit(0);
    }
    build();    
    seg.build(1,1,n);

    int j = 1;
    for(int i=1;i<=n;i++){
        dp[i] = dp[i-1] + c[s[i]-'0'];
        while(j<=i && !chk(j,i))j++;

        while(hd<rr && w(qu[rr-1]) >= w(i-1))rr--;
        qu[rr++] = i-1;
        while(hd<rr && qu[hd]<j-1)hd++;
        if(hd<rr){
            int k = qu[hd];
            tomin(dp[i],dp[k] + tc*(i-k) + tp);
        }
    }

    cout<<dp[n]<<endl;
    return 0;
}