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

const int N = 1e5 + 5;
int ar[N], br[N];
int pre[4][N];
int a, b, c;

void solve() {
	int n, m;
	cin >> n;
	a = c = b = 0;

	for (int i = 1; i <= n; ++i)
		cin >> ar[i];

	cin >> m;
	for (int i = 1; i <= m; ++i)
		cin >> br[i];

	for (int i = 1; i <= n; ++i) {
		pre[1][i] = pre[1][i - 1];
		pre[2][i] = pre[2][i - 1];
		pre[3][i] = pre[3][i - 1];
		pre[ar[i]][i] = pre[ar[i]][i - 1] + 1;
	}
	for (int i = 1; i <= m; ++i) {
		if (br[i] % 3 == 1) {
			c += 1;
		}
		if (br[i] % 3 == 2) {
			b += 1;
		}
		a += br[i] / 3;
	}
	auto check = [&](int mid) -> bool {
		int x, y, z;
		x = mid / n * pre[3][n] + pre[3][mid % n];
		y = mid / n * pre[2][n] + pre[2][mid % n];
		z = mid / n * pre[1][n] + pre[1][mid % n];
		int er = 0, yi = 0;
		for (int i = 1; i <= m; ++i) {
			int t = br[i] / 3;
			int ee = br[i] % 3;
			if (x > t) {
				x -= t;
				t = 0;
			} else if (x > 0) {
				t -= x;
				x = 0;
			}
			if (t > 0) {
				if (y > 0 and z > 0) {
					if (min(y, z) > t) {
						y -= t;
						z -= t;
						t = 0;
					} else {
						int mu = min(y, z);
						t -= mu;
						y -= mu;
						z -= mu;
					}
				}
				if (y > 0 and t > 0) {
					if ((3 * t) % 2 == 0) {
						int mu = y;

						y -= (t * 3) / 2;
						t -= (mu * 2) / 3;
					} else {
						y -= (((t * 3) / 2) + 1);
						t -= ((((t * 3) / 2) + 1) * 2) / 3;
					}
				}
				if (z > 0 and t > 0) {
					int sss = z;
					if (z >= t * 3) {
						z -= t * 3;
						t = 0;
					} else {
						t -= z / 3;
						z = z % 3;
					}
				}
			}
			if (ee == 1) {
				yi += 1;
			}
			if (ee == 2) {
				er += 1;
			}
			if (t > 0) {
				return false;
			}
		}
//		cout << yi << " " << er << " " << x << ' ' << y << ' ' << z << " " << mid << endl;
		if (yi > 0) {
			if (z > yi) {
				z -= yi;
				yi = 0;
			} else if (z > 0) {
				yi -= z;
				z = 0;
			}
			if (y > yi) {
				y -= yi;
				yi = 0;
			} else if (y > 0) {
				yi -= y;
				y = 0;
			}
			if (x > yi) {
				x -= yi;
				yi = 0;
			} else if (x > 0) {
				yi -= x;
				x = 0;
			}
		}
		if (er > 0) {
			if (y > er) {
				y -= er;
				er = 0;
			} else if (y > 0) {
				er -= y;
				y = 0;
			}
			if (z / 2 > er) {
				z -= er * 2;
				er = 0;
			} else if (z / 2 > 0) {
				er -= z / 2;
				z = z % 2;
			}
			if (x > er) {
				x -= er;
				er = 0;
			} else if (x > 0) {
				er -= x;
				x = 0;
			}
		}
		if (er > 0 or yi > 0) {
			return false;
		}
		if (x < 0 or y < 0 or z < 0) {
			return false;
		}
		return true;


	};

	int l = 1, r = 1e9;
	while (l < r) {
		int mid = l + r >> 1;
		if (check(mid))
			r = mid;
		else
			l = mid + 1;
	};
	cout << r << '\n';
}

signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int n;
	cin >> n;
	while (n--)
		solve();
	return 0;
}