#include<bits/stdc++.h>
#define f(i,x,y) for(int i=x;i<=y;i++)
#define df(i,x,y) for(int i=x;i>=y;i--)
#define int long long
#define pb push_back
using namespace std;
const int N=1.1e6,I=1e18;
int k,a[4],cs,x,al,y,c[16],f[8][8][8][8],a0,a1,a2,a3,ni,nj,nk,nl;
signed main()
{
	scanf("%lld",&cs);
	while(cs--)
	{
		scanf("%lld",&k);al=(1<<k)-1;
		f(i,0,3)a[i]=0;f(i,0,15)c[i]=0;
		f(i,1,al)scanf("%lld",&c[i]);
		f(i,0,k-1)scanf("%lld",&a[i]);
		memset(f,0xcf,sizeof(f));f[0][0][0][0]=0;
		df(d,29,0)
		{
			a0=a[0]>>d&1;a1=a[1]>>d&1;a2=a[2]>>d&1;a3=a[3]>>d&1;
			df(i,7-a0,0)df(j,7-a1,0)df(k,7-a2,0)df(l,7-a3,0)
			{
				if((i&1)|(j&1)|(k&1)|(l&1))f[i+a0][j+a1][k+a2][l+a3]=-I;
				else f[i+a0][j+a1][k+a2][l+a3]=f[i/2][j/2][k/2][l/2];
				f[i][j][k][l]=-I;
			}
			f(p,1,16)f(i,0,7)f(j,0,7)f(k,0,7)f(l,0,7)if(f[i][j][k][l]>=0)
			{
				ni=i-(p&1);nj=j-(p>>1&1);nk=k-(p>>2&1);nl=l-(p>>3&1);
				if(ni>=0&&nj>=0&&nk>=0&&nl>=0)f[ni][nj][nk][nl]=max(f[i][j][k][l]+(c[p]<<d),f[ni][nj][nk][nl]);
			}
		}
		cout<<f[0][0][0][0]<<'\n';
	}
	return 0;
}