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

typedef long long ll;

ll c[100050];
ll a[100050];
ll x[100050];

int main(){
	ios_base::sync_with_stdio(false);
	int Tcase;
	cin >> Tcase;
	for (;Tcase--;){
		ll K;
		cin >> K;
		ll N=(1<<K);
		for (int i=1;i<N;i++) cin >> c[i];
		for (int i=0;i<K;i++) cin >> a[i];
		
		for (int i=1;i<N;i++){
			for (int j=1;j<i;j++){
				if ((i&j)!=j) continue;
				c[i]=max(c[i],c[j]+c[i^j]);
			}
		}
		
		for (int i=0;i<N;i++) x[i]=0;
		x[1]=a[0];
		for (int t=1;t<K;t++){
			int st=1<<t;
			int ed=st*2;
			x[st]=a[t];
			vector<int> List;
			for (int i=st+1;i<ed;i++) List.push_back(i);
			sort(
				List.begin(),List.end(),
				[&](int u,int v){
					return (c[u]-c[u-st])>(c[v]-c[v-st]);
				}
			);
			for (auto u:List){
				ll mn=min(x[u-st],x[st]);
				x[u-st]-=mn;
				x[st]-=mn;
				x[u]+=mn;	
			}
		}
		
		ll ans=0;
		for (int i=1;i<N;i++) ans=ans+x[i]*c[i];
		cout << ans << "\n";
	}
	return 0;
}