#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 10;
void cmax(ll &x, ll y) {x = x > y ? x : y;}
ll k, c[16], a[4], f[N][N][N][N];
void solve() {
  cin >> k;
  memset(c, 0, sizeof(c));
  memset(a, 0, sizeof(a));
  for(int i = 1; i < 1 << k; i++) cin >> c[i];
  for(int i = 0; i < k; i++) cin >> a[i];
  memset(f, 0xcf, sizeof(f));
  f[0][0][0][0] = 0;
  for(int d = 29; ~d; d--) {
    int di = a[0] >> d & 1;
    int dj = a[1] >> d & 1;
    int dk = a[2] >> d & 1;
    int dl = a[3] >> d & 1;
    for(int i = N - di - 1; ~i; i--)
      for(int j = N - dj - 1; ~j; j--)
        for(int k = N - dk - 1; ~k; k--)
          for(int l = N - dl - 1; ~l; l--) {
            if((i & 1) || (j & 1) || (k & 1) || (l & 1)) f[i + di][j + dj][k + dk][l + dl] = -1e18;
            else f[i + di][j + dj][k + dk][l + dl] = f[i / 2][j / 2][k / 2][l / 2];
            if(i < di || j < dj || k < dk || l < dl) f[i][j][k][l] = -1e18;
          }
    for(int p = 1; p < 16; p++) {
      for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
          for(int k = 0; k < N; k++)
            for(int l = 0; l < N; l++)
              if(f[i][j][k][l] >= 0) {
                ll v = f[i][j][k][l] + (c[p] << d);
                int ni = i - (p & 1);
                int nj = j - (p >> 1 & 1);
                int nk = k - (p >> 2 & 1);
                int nl = l - (p >> 3 & 1);
                if(ni < 0 || nj < 0 || nk < 0 || nl < 0) continue;
                cmax(f[ni][nj][nk][nl], v);
              }
    }
  }
  cout << f[0][0][0][0] << "\n";
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  int T;
  cin >> T;
  while(T--) solve();
  cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
  return 0;
}
/*
g++ K.cpp -o K -std=c++14 -O2 -DALEX_WEI
*/