//Shirasu Azusa 2024.02.21
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
  return x*w;
}

const int N=2e5+5,inf=0x3f3f3f3f3f3f3f3f;
int n,m,w[N],nxt[N][30],cur[30],a[N],b[N],c[N],d[N],p[N],op[30],tl[N],tr[N],f[2][N],y[N],pos[N],g[N],sum;
char s[N],t[N];
vi ap[N],dp[N];

signed main() {
  scanf("%s%s",s+1,t+1);
  n=strlen(s+1), m=strlen(t+1);
  rep(i,1,n) w[i]=read(), sum+=w[i];
  rep(i,1,n) a[i]=s[i]-'a';
  rep(i,1,m) b[i]=t[i]-'a';
  rep(i,0,25) cur[i]=n+1;
  per(i,n,1) {
    rep(j,0,25) nxt[i][j]=cur[j];
    cur[a[i]]=i;
  }
  rep(i,0,30) tl[i]=m+1;
  rep(i,1,m) chmin(tl[b[i]],i), chmax(tr[b[i]],i);
  rep(i,0,25) if(tl[i]<=tr[i]) ap[tl[i]].eb(i), dp[tr[i]+1].eb(i);
  rep(t,0,1) rep(i,1,n) f[t][i]=-inf; f[0][0]=0; int ee=0;
  for(int l=1,r=1,e=1;l<=m;l=r+1,e^=1) {
    for(r=l+1;r<=n&&!ap[r].size()&&!dp[r].size();r++); r--;
    //cout<<l<<" "<<r<<endl;
    for(int x:dp[l]) p[x]=0;
    rep(i,1,n) if(!p[a[i]]) chmax(f[e^1][i],f[e^1][i-1]);
    for(int x:ap[l]) p[x]=1;
    int k=0,t=0;
    rep(i,1,n) if(p[a[i]]) c[++k]=a[i], pos[k]=i, y[k]=w[i];
    rep(i,1,k) y[i]+=y[i-1];
    rep(i,l,r) d[++t]=b[i]; d[t+1]=30;
    for(int i=2,j=0;i<=t;i++) {
      while(j&&d[j+1]!=d[i]) j=g[j];
      if(d[j+1]==d[i]) j++; g[i]=j;
    }
    rep(i,0,n) f[e][i]=-inf;
    for(int i=1,j=0;i<=k;i++) {
      while(j&&d[j+1]!=c[i]) j=g[j];
      if(d[j+1]==c[i]) j++;
      //cout<<i<<" "<<j<<" "<<t<<" "<<pos[i]<<endl;
      if(j==t) chmax(f[e][pos[i]],f[e^1][pos[i-t+1]-1]+y[i]-y[i-t]);
    } ee=e;
    //rep(i,0,n) cout<<f[e^1][i]<<" "; puts("");
    //rep(i,0,n) cout<<f[e][i]<<" "; puts("");
  }
  int ans=-inf; rep(i,1,n) chmax(ans,f[ee][i]);
  if(ans<0) puts("You better start from scratch man...");
  else printf("%lld\n",sum-ans);
  return 0;
}