#include <iostream>
#include <cstdio>
#define mn 100005
#define ll long long

using namespace std;

int n, m, p, k, a[mn], v[30];
char s[mn];

int c[mn], cnt[mn], ban[mn];
ll ans, res[mn];

int main() {
	scanf("%d", &n);
	scanf("%s", s + 1);
	for(int i = 1; i <= n; ++i) {
		if(s[i] == '?') a[i] = 0;
		else a[i] = s[i] - 'A' + 1;
	}
	scanf("%d\n", &m);
	for(int i = 1; i <= m; ++i) {
		char c; int x;
		scanf("%c %d\n", &c, &x);
		v[c - 'A' + 1] = x;
	}
	for(p = 2; p <= n; ++p) {
		if(!(n % p)) break;
	}
	int x = n;
	k = 0;
	while(!(x % p)) ++k, x /= p;

	int m = 1;
	for(int i = 2; i <= 26; ++i) {
		if(v[i] > v[m]) m = i;
	}
	for(int i = 1; i <= n; ++i) {
		if(!a[i]) {
			c[i] = m, res[i] = v[m], cnt[i] = 1;
		}
		else {
			c[i] = a[i], res[i] = v[a[i]], cnt[i] = 0;
		}
		// printf("%d %lld\n", i, res[i]);
	}

	// i < (k?)
	for(int i = 1, u = n / p, s = 1; i <= k; ++i, u /= p, s *= p) {
		int uu = u * p;
		// printf("%d %d %d\n", i, u, s);
		for(int j = 1; j <= u; ++j) {
			int same = 1, ssame = 1, cto = 0, cntsum = 0, hban = 0;
			ll ressum = 0;
			// for(int o = 1; o <= n; ++o) {
			// 	printf("%d ", ban[o]);
			// }
			// puts("o");
			for(int l = j; l <= uu; l += u) {
				if(cnt[l] < s) {
					cto = c[l];
				}
				if(ban[l]) hban = 1;
				// printf("l%d \n", l);
			}
			if(hban) {
				for(int l = j; l <= uu; l += u) {
					if(!ban[l]) {
						ban[l] = 1;
						ans += 1ll * v[c[l]] * s * i;
					}
				}
				// printf("aaa%lld\n", ans);
				continue;
			}
			for(int l = j; l <= uu; l += u) {
				if(cnt[l] < s && c[l] != cto) {
					same = 0;
				}
				if(c[l] != c[j]) {
					ssame = 0;
				}
				cntsum += cnt[l], ressum += res[l];
			}
			// printf("%d %lld\n", cntsum, ressum);
			if(same) {
				// printf("p%lld %lld\n", 1ll * v[cto] * s * p * (i + 1) , ressum);
				if(1ll * v[cto] * s * p * (i + 1) > ressum) {
					c[j] = cto;
					res[j] = 1ll * v[cto] * s * p * (i + 1);
					// printf("j%d %lld\n", j, res[j]);
					cnt[j] = cntsum;
				}
				else {
					if(ssame) {
						res[j] = 1ll * v[c[j]] * s * p * (i + 1);
						cnt[j] = cntsum;
					}
					else {
						for(int l = j; l <= uu; l += u) {
							ban[l] = 1;
							ans += 1ll * v[c[l]] * s * i;
						}
					}
					// res[j] = ressum;
				}
			}
			else {
				for(int l = j; l <= uu; l += u) {
					ban[l] = 1;
					ans += 1ll * v[c[l]] * s * i;
				}
				// ans += ressum;
			}
			// for(int o = 1; o <= n; ++o) printf("%lld ", res[o]);
			// 	printf("ans%lld\n", ans);
			// puts("");
		}
	}
	if(!ban[1]) ans = 1ll * v[c[1]] * n * (k + 1);
	printf("%lld", ans);
	return 0;
}