#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


void experiment() {
  int mx = 0;
  for (int p = 0; p < 1 << 15; ++p) {
    if ([&]() -> bool {
      for (int i = 1; i < 16; ++i) if (p >> i & 1) {
        for (int j = 1; j < i; ++j) if (p >> j & 1) {
          for (int k = 1; k < j; ++k) if (p >> k & 1) {
            if (0 == (j & k) && i == (j | k)) {
              return false;
            }
          }
        }
      }
      for (int i = 1; i < 16; ++i) if (p >> i & 1) {
        for (int j = 1; j < i; ++j) if (p >> j & 1) {
          for (int k = 1; k < i; ++k) if (p >> k & 1) {
            for (int l = 1; l < k; ++l) if (p >> l & 1) {
              if ((i & j) == (k & l) && (i | j) == (k | l)) {
                return false;
              }
            }
          }
        }
      }
      return true;
    }()) {
      chmax(mx, __builtin_popcount(p));
    }
  }
  cerr << "mx = " << mx << endl;
  // 7
}

int K;
Int C[16];
Int A[4];

constexpr Int INF = 4001001001001001001LL;
constexpr int E = 30;
constexpr int S = 6;  // ?
Int dp[2][2*S+2][2*S+2][2*S+2][2*S+2];

int main() {
  experiment();
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    memset(C, 0, sizeof(C));
    memset(A, 0, sizeof(A));
    scanf("%d", &K);
    for (int i = 1; i < 1 << K; ++i) {
      scanf("%lld", &C[i]);
    }
    for (int k = 0; k < K; ++k) {
      scanf("%lld", &A[k]);
    }
    
    int lim;
#define rep(x) for (int x = 0; x <= lim; ++x)
    
    auto crt = dp[0], nxt = dp[1];
    lim = 2 * S;
    rep(x0) rep(x1) rep(x2) rep(x3) {
      crt[x0][x1][x2][x3] = -INF;
    }
    crt[0][0][0][0] = 0;
    for (int e = 0; e < E; ++e) {
      for (int i = 1; i < 1 << K; ++i) {
        const Int c = C[i] << e;
        lim = min(S + i, 2 * S);
        rep(x0) rep(x1) rep(x2) rep(x3) {
          nxt[x0][x1][x2][x3] = -INF;
        }
        lim = min(S + i - 1, 2 * S);
        rep(x0) rep(x1) rep(x2) rep(x3) {
          // 0
          chmax(nxt[x0][x1][x2][x3], crt[x0][x1][x2][x3]);
          // 1
          const int y0 = x0 + ((i >> 0) & 1);
          const int y1 = x1 + ((i >> 1) & 1);
          const int y2 = x2 + ((i >> 2) & 1);
          const int y3 = x3 + ((i >> 3) & 1);
          chmax(nxt[y0][y1][y2][y3], crt[x0][x1][x2][x3] + c);
        }
        swap(crt, nxt);
      }
      const int a0 = (A[0] >> e) & 1;
      const int a1 = (A[1] >> e) & 1;
      const int a2 = (A[2] >> e) & 1;
      const int a3 = (A[3] >> e) & 1;
      lim = S;
      rep(x0) rep(x1) rep(x2) rep(x3) {
        const int y0 = 2 * x0 + a0;
        const int y1 = 2 * x1 + a1;
        const int y2 = 2 * x2 + a2;
        const int y3 = 2 * x3 + a3;
        if (y0 <= 2 * S && y1 <= 2 * S && y2 <= 2 * S && y3 <= 2 * S) {
          nxt[x0][x1][x2][x3] = crt[y0][y1][y2][y3];
        }
      }
      swap(crt, nxt);
    }
    printf("%lld\n", crt[0][0][0][0]);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}