#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <cstdlib>typedeflonglong ll;
usingnamespacestd;
struct good{
int v, w;
};
good g[1005];
int p[105], dp[105];
int main() {
int T;
scanf("%d", &T);
while (T--) {
int n, m;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &g[i].v, &g[i].w);
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
scanf("%d", &p[i]);
}
int sum = 0;
for (int i = 0; i < m; i++) {
int Max = 0;
memset(dp, 0, sizeof(dp));
for (int j = 0; j < n; j++) {
for (int k = p[i]; k > 0; k--) {
if ((k == g[j].w || dp[k - g[j].w]) && dp[k] < dp[k - g[j].w] + g[j].v) {
dp[k] = dp[k - g[j].w] + g[j].v;
if (dp[k] > Max) Max = dp[k];
}
}
}
sum += Max;
}
printf("%d\n", sum);
}
return0;
}