#include<bits/stdc++.h>
using namespace std; typedef long long ll;
const ll INF = 1e18,M = 30;
void tomax(ll& x,ll y){x = (x>y)?(x):(y);}

int T,k,c[16],a[4];

ll dp[M+1][4096],g[16][625],pw[5];

void solve(){
	pw[0] = 1,pw[1] = 5,pw[2] = 25,pw[3] = 125,pw[4] = 625;

	cin>>k;
	for(int i=1;i<(1<<k);i++)cin>>c[i]; for(int i=0;i<k;i++)cin>>a[i];

	for(int i=0;i<(1<<k);i++)for(int S=0;S<pw[k];S++)g[i][S] = -INF;
	for(int S=0;S<(1<<(1<<k));S++)if(!(S&1)){
		int lim = 0,nxt = 0;
		for(int j=0;j<k;j++){
			int cnt = 0;
			for(int p=1;p<(1<<k);p++)if( (S>>p&1) && (p>>j&1) ){
				lim ^= 1<<j;
				cnt++;
			}
			nxt += (cnt>>1) * pw[j];
		}
		ll sum = 0;
		for(int p=1;p<(1<<k);p++)if(S>>p&1)sum += c[p];
		tomax(g[lim][nxt],sum);
	}

	for(int i=0;i<=M;i++)for(int S=0;S<(1<<3*k);S++)dp[i][S] = -INF;
	dp[0][0] = 0;

	for(int i=0;i<M;i++){
		ll pv,qv;
		for(int S=0;S<(1<<3*k);S++)if((pv=dp[i][S]) != -INF){
			int lim = 0;
			for(int j=0,p=7;j<k;j++,p<<=3){
				int val = ((S&p)>>3*j)&1;
				lim |= (val != (a[j]>>i&1)) << j;
			}
			
			for(int T=0;T<pw[k];T++)if((qv=g[lim][T]) != -INF){
				int nxt = 0;
				for(int j=0,p=7;j<k;j++,p<<=3){
					int val = (((S&p)>>3*j)+(lim>>j&1))/2 + (T/pw[j]%5);
					assert(val <= 7);
					nxt |= val << (3*j);
				}
				tomax(dp[i+1][nxt],pv + (qv << i));
			}
			
		}
	}

	ll ans = dp[M][0];
	(ans == -INF) ? (cout<<"-1\n") : (cout<<ans<<"\n");
}

int main(){
	cin>>T;
	while(T--)solve();

	return 0;
}