#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
#define pb emplace_back
using namespace std;
const int N = 1 << 18;
const int M = 150;
int k, q, v[N];
string s[N];
int dp[N][M];
int ch[N][2], fa[N], tot;
int seq[N], dep[N];
int ord[N];
void build() {
	queue<int>q;
	L(i, 0, 1) if(ch[0][i]) q.push(ch[0][i]);
	while(!q.empty()) {
		int u = q.front();
		q.pop();
		L(j, 0, 1) 
			if(ch[u][j]) fa[ch[u][j]] = ch[fa[u]][j], q.push(ch[u][j]);
			else ch[u][j] = ch[fa[u]][j];
	}
}
vi e[N];
int f[N];
int vis[N], deg[N];
int ss[N];
vi LST[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> k;
	L(i, 0, k - 1) {
		cin >> s[i] >> v[i];
		int cur = 0;
		L(j, 0, sz(s[i]) - 1) {
			if(!ch[cur][s[i][j] - '0']) ch[cur][s[i][j] - '0'] = ++tot;
			cur = ch[cur][s[i][j] - '0'];
			dep[cur] = j + 1;
		}
		seq[cur] |= 1 << i;
	}
	build();
	L(i, 1, tot) {
		ord[i] = i;
	}
	sort(ord + 1, ord + tot + 1, [&] (int x, int y) {
		return dep[x] < dep[y];
	});
	L(i, 1, tot) 
		seq[ord[i]] |= seq[fa[ord[i]]];
	// L(i, 0, tot) {
	// 	L(j, 0, 1) {
	// 		cout << ch[i][j] << ' ';
	// 	}
	// 	cout << endl;
	// }
	// return 0;
	
	L(i, 0, (1 << k) - 1) 
		L(j, 0, k - 1) 
			if(i >> j & 1) 
				f[i] += v[j];
	L(i, 0, tot)
		L(j, 0, 1)
			LST[ch[i][j]].pb(i);
	L(i, 0, (1 << k) - 1) {
		L(j, 0, tot) {
			dp[i][j] = -1e9;
			if(seq[j] & i) {
				int r = seq[j] & i;
				ss[j] = f[r] - dp[i - r][j];
				// cout << "j = " << j << endl; 
				// if(ss[j] > 0) cout << j << " qwq" << endl;
				vis[j] = 0;
			} else {
				vis[j] = 1;
			}
		}
		priority_queue<pair<int,int>>pq;
		L(j, 0, tot) if(vis[j]) {
			deg[j] = 2;
			L(o, 0, 1) {
				int to = ch[j][o];
				if(!vis[to]) {
					dp[i][j] = max(dp[i][j], ss[to]);
					// if(ss[to] > 0) {
					// 	cout << i << " and " << j << endl;
					// }
					--deg[j]; 
				} 
			}
			if(dp[i][j] > 0 || !deg[j]) pq.push({dp[i][j], j});
		}
		vi can(tot + 1);
		while(!pq.empty()) {
			int u = pq.top().second;
			pq.pop();
			if(dp[i][u] <= 0 && deg[u]) {
				continue;
			}
			if(can[u])continue;
			// if(i == 5) {
			// 	cout << "u = " << u << ' ' <<  << endl;
			// }
			can[u] = 1;
			for(auto&v : LST[u]) if(vis[v]) {
				--deg[v], dp[i][v] = max(dp[i][v], -dp[i][u]);
				if(dp[i][v] > 0 || !deg[v]) pq.push({dp[i][v], v});
			}
		}
		L(j, 0, tot) if(dp[i][j] < -1e8 && deg[j]) dp[i][j] = 0;
		// L(j, 0, tot) {
		// 	cout << i << ' ' << j << " : " << dp[i][j] << endl;
		// }
	}
	// cout << "DP = " << dp[5][3] << ' ' << dp[5][ch[3][1]] << endl;
	cin >> q;
	while(q--) {
		string S;
		cin >> S;
		int cur = 0, mask = (1 << k) - 1;
		L(i, 0, sz(S) - 1) {
			cur = ch[cur][S[i] - '0'];
			mask -= mask & seq[cur];
		}
		cout << dp[mask][cur] << '\n';
	}
	return 0;
} 
/*
1
3 2
2023 40 41
1 1 2022
2 2 39
*/