#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define N 100010
#define LL long long
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int rd() {
	int res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
int n,K,p;
char s[N],ch;
int val[30];
LL pre[30];
LL gets(int c,int flag) {
	LL res=0;
	for(int x=1;x<=n;x*=p) {
		rep(i,1,x) {
			bool f=1;
			for(int j=i;j<=n;j+=x) {
				if(s[j]!=(char)(c+'A'-1)&&(!flag||(flag&&s[j]!='?'))) {
					f=0;
					break;
				}
			}
			if(f) res+=1ll*n/x*val[c];
		}
	}
	return res;
}
int main() {
//	freopen("C.in","r",stdin);
	n=rd();
	scanf("%s",s+1);
	K=rd();
	rep(i,1,K) ch=getchar(),val[ch-'A'+1]=rd();
	
	if(n==1) {
		if(s[1]!='?') printf("%d",val[s[1]-'A'+1]);
		else {
			int mx=0;
			rep(i,1,26) mx=max(mx,val[i]);
			printf("%d",mx);
		}
		return 0;
	}
	
	p=2;
	while(n%p) p++;
	rep(i,1,26) pre[i]=gets(i,0);
	LL ans=0;
	rep(i,1,26) {
		LL res=0;
		rep(j,1,26) if(j!=i) res+=pre[j];
		res+=gets(i,1);
		ans=max(ans,res);
	}
	printf("%lld",ans);
	return 0;
}