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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;


bool check(LL cnt1, LL cnt2, LL cnt3, VI hp)
{
	FOR(i, 0, SZ(hp))
	{
		if(hp[i] % 2 == 1 && hp[i] >= 3 && cnt3 > 0)
		{
			hp[i] -= 3;
			cnt3--;
		}
	}
	FOR(i, 0, SZ(hp))
	{
		LL num = min((LL)hp[i] / 6, cnt3 / 2);
		hp[i] -= 6 * num;
		cnt3 -= 2 * num;
	}
	FOR(i, 0, SZ(hp))
	{
		if(hp[i] == 4 && cnt3 > 0)
		{
			hp[i] -= 3;
			cnt3--;
		}
	}
	if(cnt3 == 1)
	{
		FOR(i, 0, SZ(hp))
		{
			if(hp[i] >= 3 && cnt3 > 0)
			{
				hp[i] -= 3;
				cnt3--;
			}
		}
	}
	cnt2 += cnt3;
	FOR(i, 0, SZ(hp))
	{
		if(hp[i] % 2 == 1 && cnt1 > 0)
		{
			hp[i] -= 1;
			cnt1--;
		}
	}
	cnt2 += (cnt1 / 2);
	FOR(i, 0, SZ(hp))
	{
		LL num = (hp[i] + 1) / 2;
		cnt2 -= num;
	}
	return cnt2 >= 0;	
}

void solve()
{
	int n;
	cin >> n;
	VI cnt[4];
	FOR(i, 0, 4)
		cnt[i].resize(n + 1);
	FOR(i, 0, n)
	{
		int x;
		cin >> x;
		FOR(j, 0, 4)
			cnt[j][i + 1] = cnt[j][i];
		cnt[x][i + 1]++;
	}
	int m;
	cin >> m;
	VI hp(m);
	FOR(i, 0, m)
		cin >> hp[i];
	
	LL L = 0, R = 1e17;
	while(R - L > 1)
	{
		LL M = (L + R) / 2;
		LL full = M / n;
		LL ost = M % n;
		
		LL cnt1 = cnt[1][n] * full + cnt[1][ost];
		LL cnt2 = cnt[2][n] * full + cnt[2][ost];
		LL cnt3 = cnt[3][n] * full + cnt[3][ost];
		
		if(check(cnt1, cnt2, cnt3, hp))
			R = M;
		else
			L = M;
	}
	cout << R << "\n";
}


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int t;
	cin >> t;
	while(t--)
		solve();
	
	return 0;
}