#include <bits/stdc++.h>

using namespace std;

const int N = 18, L = 180;

int n, sum[1 << N], hv[L], ch[2][L], tot;

void insert(string S, int id) {
    int now = 0;
    for (int c : S) {
        c -= '0';
        if (!ch[c][now]) ch[c][now] = ++tot;
        now = ch[c][now];
    }
    hv[now] |= (1 << id);
}

int fail[L];

void build() {
    queue<int> Q;
    for (int i = 0; i < 2; ++i) {
        if (ch[i][0]) Q.push(ch[i][0]);
    }
    while (!Q.empty()) {
        int x = Q.front();
        Q.pop();
        for (int i = 0; i < 2; ++i) {
            if (ch[i][x]) fail[ch[i][x]] = ch[i][fail[x]], Q.push(ch[i][x]);
            else ch[i][x] = ch[i][fail[x]];
        }
    }
    for (int i = 0; i <= tot; ++i) hv[i] |= hv[fail[i]];
}

int f[1 << N][L], du[L];
vector<int> rG[L];

void dp() {
    memset(f, -0x3f, sizeof(f));
    for (int i = 0; i <= tot; ++i) f[(1 << n) - 1][i] = 0;
    for (int i = (1 << n) - 2; ~i; --i) {
        for (int j = 0; j <= tot; ++j) du[j] = 0, rG[j].clear();
        for (int j = 0; j <= tot; ++j) for (int k = 0; k < 2; ++k) {
            if ((hv[ch[k][j]] | i) != i) {
                f[i][j] = max(f[i][j], -f[hv[ch[k][j]] | i][ch[k][j]] + sum[hv[ch[k][j]] & ~i]);
            } else {
                rG[ch[k][j]].push_back(j);
                ++du[j];
            }
        }
        priority_queue< pair<int, int> > pq;
        for (int j = 0; j <= tot; ++j) pq.push(make_pair(f[i][j], j));
        int cnt = tot + 1;
        queue<int> Q;
        for (int j = 0; j <= tot; ++j) if (!du[j]) {
            Q.push(j);
        }
        while (cnt) {
            while (!Q.empty()) {
                int x = Q.front(); Q.pop(), --cnt;
                for (auto v : rG[x]) {
                    f[i][v] = max(f[i][v], -f[i][x]);
                    pq.push(make_pair(f[i][v], v));
                    if (!--du[v]) Q.push(v);
                }
            }
            if (cnt) {
                while (1) {
                    int y = pq.top().second;
                    pq.pop();
                    if (du[y] <= 0) continue;
                    if (f[i][y] <= 0) {
                        for (int j = 0; j <= tot; ++j) if (du[j] > 0) f[i][j] = 0;
                        cnt = 0;
                        break;
                    }
                    du[y] = 0;
                    Q.push(y);
                    break;
                }
            }
        }
    }
}

signed main() {
    scanf("%d", &n);
    for (int i = 0, V; i < n; ++i) {
        string S; cin >> S;
        insert(S, i);
        scanf("%d", &V);
        for (int j = 0; j < 1 << n; ++j) if ((j >> i) & 1) sum[j] += V;
    }
    build();
    dp();
    int q; scanf("%d", &q);
    while (q--) {
        string S; cin >> S;
        int now = 0, sta = 0;
        for (int c : S) now = ch[c - '0'][now], sta |= hv[now];
        printf("%d\n", f[sta][now]);
    }
    return 0;
}