#pragma GCC optimize("Ofast", "unroll-loops")
#include<bits/stdc++.h>
using namespace std; using ll = long long;
#define For(i, j, k) for ( int i = (j) ; i <= (k) ; i++ )
#define Fol(i, j, k) for ( int i = (j) ; i >= (k) ; i-- )
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
template < class T > inline T R(T l, T r) { return uniform_int_distribution < T >(l, r)(rnd); }
constexpr ll inf = numeric_limits < ll >::max() >> 1, P = 1145141919810000037; const ll B = R(233ll, P - 233ll);
inline void add(ll &x) { x >= P && ( x -= P ); }
inline void sub(ll &x) { x < 0 && ( x += P ); }
inline ll mul(ll x, ll y) { ll z = x * y - (ll)( 1.l * x * y / P ) * P; return z >= P && ( z -= P ), z < 0 && ( z += P ), z; }
ll pw[200009];
int n, m, s[200009], t[200009], w[200009], fst[26], lst[26], st[59], sz[59], ch[59], len, nwst, nwsz, id[200009], l;
ll nwnd, nd[200009], h[200009], cur, sum[200009], dp[200009], ans; bool key[200009];
namespace ST
{
	ll t[200009 << 2]; int m;
	inline void build()
	{
		m = 2 << __lg(n + 1), copy(dp, dp + n + 1, t + m + 1);
		Fol(p, m - 1, 1) t[p] = max(t[p << 1], t[p << 1 | 1]);
	}
	inline ll qry(int l, int r)
	{
		if ( l > r ) return -inf;
		ll z = -inf;
		for ( l += m, r += m + 2 ; l ^ r ^ 1 ; l >>= 1, r >>= 1 )
		{
			if ( ~l & 1 ) z = max(z, t[l ^ 1]);
			if (  r & 1 ) z = max(z, t[r ^ 1]);
		}
		return z;
	}
}
int main()
{
	// freopen("edit.in", "r", stdin), freopen("edit.out", "w", stdout);
	cin.tie(nullptr) -> sync_with_stdio(false);
	{ string _; cin >> _, n = (int)_.size(); For(i, 1, n) s[i] = _[i - 1] - 'a'; }
	{ string _; cin >> _, m = (int)_.size(); For(i, 1, m) t[i] = _[i - 1] - 'a'; }
	For(i, 1, n) cin >> w[i];
	*pw = 1; For(i, 1, n) pw[i] = mul(pw[i - 1], B);
	Fol(i, m, 1) fst[t[i]] = i;
	For(i, 1, m) lst[t[i]] = i;
	For(i, 0, 25) if ( fst[i] ) key[fst[i]] = key[lst[i]] = true;
	For(i, 1, m)
		if ( key[i] )
		{
			st[++len] = nwst, sz[len] = nwsz, nd[len] = nwnd, ch[len] = t[i], nwsz = nwnd = 0;
			if ( fst[t[i]] != lst[t[i]] ) nwst ^= 1 << t[i];
		}
		else assert(nwst & ( 1 << t[i] )), nwsz++, add(nwnd = mul(nwnd, B) + t[i]);
	For(i, 1, len)
	{
		ST::build(), l = 0, fill(dp, dp + n + 1, -inf);
		For(j, 1, n)
		{
			if ( l >= sz[i] && s[j] == ch[i] )
			{
				sub(cur = h[l] - mul(h[l - sz[i]], pw[sz[i]]));
				if ( cur == nd[i] ) dp[j] = ST::qry(id[l - sz[i]], ( sz[i] ? id[l + 1 - sz[i]] : j ) - 1) + w[j] + sum[l] - sum[l - sz[i]];
			}
			if ( st[i] & ( 1 << s[j] ) ) id[++l] = j, add(h[l] = mul(h[l - 1], B) + s[j]), sum[l] = sum[l - 1] + w[j];
		}
	}
	ans = *max_element(dp, dp + n + 1);
	if ( ans < 0 ) return cout << "You better start from scratch man...\n", 0;
	return cout << accumulate(w + 1, w + n + 1, 0ll) - ans << '\n', 0;
}