#include <bits/stdc++.h>
using namespace std;

const int N = 100100;
using ll = long long;

int n, p, m, k;
char str[N];

int value[28];

vector<ll> dp[30];
vector<int> col[30];
ll pw[30];

int merge(int x, int y) {
    if (x == 26) return y;
    if (y == 26) return x;
    if (x == y) return x;
    return 27;
}

int main() {
    cin >> n >> str >> k;
    if (n > 1e5 || k > 26 || str[n]) {
        cout << "Fuck you";
        return 0;
    }
    for (int i = 0; i < k; i++) {
        string ch;
        int val;
        cin >> ch >> val;
        value[ch[0] - 'A'] = val;
        value[26] = max(value[26], val);
    }
    for (int i = 2; i <= n; i++) if (n % i == 0) { p = i; break; }

    for (int x = 1; x <= n; x *= p)
        pw[m++] = x;
    m--;

    if (pw[m] != n) {
        cout << "Fuck you";
        return 0;
    }

    for (int i = 0; i <= m; i++) {
        dp[i].resize(pw[i]);
        col[i].resize(pw[i]);
    }

    for (int i = 0; i < n; i++) {
        col[m][i] = (str[i] == '?' ? 26 : str[i] - 'A');
        dp[m][i] = value[col[m][i]];
    }
    
    for (int i = m - 1; i >= 0; i--) {
        for (int j = 0; j < pw[i]; j++) {
            col[i][j] = 26, dp[i][j] = 0;
            for (int k = 0; k < pw[i + 1]; k += pw[i]) {
                col[i][j] = merge(col[i][j], col[i + 1][j + k]);
                dp[i][j] += dp[i + 1][j + k];
            }
            dp[i][j] = max(dp[i][j], value[col[i][j]] * pw[m - i] * (m - i + 1));
        }
    }
    cout << dp[0][0] << "\n";
}