//I am a fresh scratch man. 
#include <bits/stdc++.h>
#define il inline
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
il void cmax(ll &x,ll y){x=x>y?x:y;}
il ll read(){
    ll x=0,c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=x*10+c-48,c=getchar();
    return x;
}
const int N=2e5+5;const ll inf=1e18;const ull mul=131;
int n,m,k,b[N],c[N],tot,L[26],R[26],to[N][60],vis[26];char s[N],t[N];ll a[N],f[N][60],sum[N],ans=-inf,val[N][60];
ull h1[N],h2[N],pw[N];int ck[60][26];
il ull get1(int l,int r){return h1[r]-h1[l-1]*pw[r-l+1];}
il ull get2(int l,int r){return h2[r]-h2[l-1]*pw[r-l+1];}
il void init(int p){
    int x,y,z,u,v,w;
    for(int i=0;i<26;++i) vis[i]=0;
    for(int i=0;i<26;++i){
        if(b[p]<L[i] || b[p]>R[i]){vis[i]=1;continue;}
        if(b[p]!=L[i]) ck[p][i]=1;
    }
    tot=0;
    for(int i=1;i<=n;++i){
        x=s[i]-'a';
        if(!vis[x]) c[++tot]=i;
    }
    for(int i=1;i<=tot;++i) sum[i]=sum[i-1]+1ll*a[c[i]],h1[i]=h1[i-1]*mul+s[c[i]];
    int len=b[p+1]-b[p];
    for(int i=1;i+len-1<=tot;++i){
        if(get1(i,i+len-1)!=get2(b[p],b[p+1]-1)){val[c[i]][p]=-inf;continue;}
        x=c[i],to[x][p]=c[i+len-1]+1,val[x][p]=sum[i+len-1]-sum[i-1];
    }
}
il void build(){
    pw[0]=1ull;for(int i=1;i<=n;++i) pw[i]=pw[i-1]*mul;
    for(int i=1;i<=m;++i) h2[i]=h2[i-1]*mul+t[i];
}
int x,y,z;ll u,v,w;
int main(){
	scanf("%s%s",s+1,t+1);n=strlen(s+1),m=strlen(t+1);if(n<m){printf("You better start from scratch man...");exit(0);}
    build();
	for(int i=1;i<=n;++i) a[i]=read();
	for(int i=0;i<26;++i) L[i]=m+1,R[i]=0;
	for(int i=1;i<=m;++i) x=t[i]-'a',L[x]=min(L[x],i),R[x]=max(R[x],i);
    for(int i=0;i<26;++i) if(R[i]) b[++k]=L[i],b[++k]=R[i]+1;b[++k]=1,b[++k]=m+1;
	sort(b+1,b+1+k);k=unique(b+1,b+1+k)-b-1;
    //for(int i=1;i<=k;++i) printf("%d ",b[i]);puts("");
    for(int i=0;i<=n+1;++i) for(int j=0;j<k;++j) f[i][j]=-inf;
    for(int i=1;i<k;++i) init(i);
    f[1][0]=0ll;
    for(int i=1;i<=n;++i){
        for(int j=0;j<k-1;++j){
            if(f[i][j]<0ll) continue;
            if(val[i][j+1]>0ll) cmax(f[to[i][j+1]][j+1],f[i][j]+val[i][j+1]);
            if(!ck[j+1][s[i]-'a']) cmax(f[i+1][j],f[i][j]);
        }
    }
    for(int i=1;i<=n+1;++i) cmax(ans,f[i][k-1]);
	if(ans<0){printf("You better start from scratch man...");exit(0);}
    ans=-ans;for(int i=1;i<=n;++i) ans+=a[i];
    printf("%lld",ans);
	return 0;
}