#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 15 + 5;
const int ALL = (1 << (3 * 4)) + 5;

#define bbit(i) (1<<(i))
#define bdig(x,i) (((x)>>(i))&1)
#define lowbit(x) ((x)&-(x))

ll a[MAXN], c[MAXN];

void solve(void)
{
	int d;
	scanf("%d",&d);
	for(int i=1; i<(1<<d); ++i)
		scanf("%lld",&c[i]);
	for(int i=0; i<d; ++i)
		scanf("%lld",&a[i]);
	
	static int trans[MAXN];
	for(int i=1; i<(1<<d); ++i)
	{
		trans[i] = 0;
		for(int j=0; j<d; ++j) if(bdig(i,j))
			trans[i] |= 1 << (3 * j);
	}
	
	int all = 1 << (3 * d);
	
	vector< vector<int> > useful(1<<d);
	for(int i=1; i<(1<<d); ++i) if(i != lowbit(i))
		for(int mask=all-1; mask>=0; --mask)
		{
			bool flag = 1;
			for(int j=0; j<d; ++j)
			{
				int x = (mask >> (3 * j)) & 7;
				flag &= x + bdig(i, j) <= 7;
			}
			if(flag) useful[i].emplace_back(mask);
		}
	
	const int lb = 30;
	
	static ll f[ALL];
	memset(f, 0xc0, sizeof(f));
	f[0] = 0;
	for(int k=0; k<lb; ++k)
	{
		for(int i=1; i<(1<<d); ++i) if(i != lowbit(i))
			for(int mask: useful[i])
				f[mask + trans[i]] = max(f[mask + trans[i]], f[mask] + (c[i] << k));
		
		static ll nf[ALL];
		memset(nf, 0xc0, sizeof(nf));
		for(int mask=0; mask<all; ++mask) if(f[mask] >= 0)
		{
			int nxt = 0;
			ll cur = f[mask];
			for(int i=0; i<d; ++i)
			{
				int x = (mask >> (3 * i)) & 7;
				
				if((x & 1) != ((a[i] >> k) & 1))
					++x, cur += c[1 << i] << k;
				
				nxt |= (x >> 1) << (3 * i);
			}
			nf[nxt] = max(nf[nxt], cur);
		}
		memcpy(f, nf, sizeof(f));
	}
	
	printf("%lld\n",f[0]);
}

int main(void)
{
	int T;
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}