#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=1e5+10;
int T,n,m,a[N],b[N],c[N];
bool chk(ll mid){
	copy(b+1,b+1+m,c+1);
	ll t1=0,t2=0,t3=0;
	for(int i=1;i<=n;i++){
		if(a[i]==1)t1+=mid/n+(i<=mid%n);
		else if(a[i]==2)t2+=mid/n+(i<=mid%n);
		else if(a[i]==3)t3+=mid/n+(i<=mid%n);
	}
	// debug(t1,t2,t3,ary(c,1,m));
	for(int i=1;i<=m&&t3;i++){
		if(c[i]>=3&&c[i]%2==1)c[i]-=3,t3--;
	}
	for(int i=1;i<=m&&t3;i++){
		ll x=min(t3/2,1ll*c[i]/6);
		t3-=x*2,c[i]-=x*6;
	}
	for(int i:{5,4,2,1}){
		for(int j=1;j<=n&&t3;j++){
			if(c[j]==i)c[j]=max(0,c[j]-3),t3--;
		}
	}
	for(int i=1;i<=m&&t2;i++){
		ll x=min(t2,1ll*c[i]/2);
		t2-=x,c[i]-=x*2;
	}
	for(int i=1;i<=m&&t2;i++){
		if(c[i])c[i]=max(0,c[i]-2),t2--;
	}
	return accumulate(c+1,c+1+m,0ll)<=t1;
}
void get(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	scanf("%d",&m);
	for(int i=1;i<=m;i++)scanf("%d",&b[i]);
	ll l=0,r=2e14,mid;
	// chk(r);
	for(;l+1<r;){
		mid=(l+r)>>1;
		if(chk(mid))r=mid;
		else l=mid;
	}
	printf("%lld\n",r);
}
int main(){
	for(scanf("%d",&T);T--;)get();
	return 0;
}