#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

void solve() {
	int n; cin >> n;
	vector<ll> a(n);
	for (ll &i : a) cin >> i;

	int m; cin >> m;
	vector<ll> h(m);
	for (ll &i : h) cin >> i;

	ll lb = 1, ub = 1e17;
	ll oneTot = 0, twoTot = 0, threeTot = 0;
	for (int i = 0; i < a.size(); i++) {
		if (a[i] == 1) oneTot += 1;
		if (a[i] == 2) twoTot += 1;
		if (a[i] == 3) threeTot += 1;
	}
	while (lb < ub-1) {
		ll m = (lb+ub)/2;

		ll cycle = m / a.size();
		ll one = cycle*oneTot, two = cycle*twoTot, three = cycle*threeTot;
		for (int i = 0; i < m%a.size(); i++) {
			if (a[i] == 1) one += 1;
			if (a[i] == 2) two += 1;
			if (a[i] == 3) three += 1;
		}

		bool bad = false;
		for (ll x : h) {
			ll useThree = min(three, x / 3);
			three -= useThree;
			x -= useThree * 3;

			ll useTwo = min(two, x / 2);
			two -= useTwo;
			x -= useTwo * 2;

			ll useOne = min(one, x);
			one -= useOne;
			x -= useOne;

			if (x == 1 && two > 0) {
				two--;
				x = 0;
			}
			if (x >= 1 && three > 0) {
				three--;
				x = 0;
			}
			if (x > 0) bad = true;
		}
		if (!bad) ub = m+1;
		else lb = m+1;
	}
	cout << lb << endl;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int t; cin >> t;
	while (t--) solve();
}