#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 1e9 + 7, N = 53, M = 200000;

int c[16], a[4];
ll dp[2][1 << 16];
int nxt[1 << 16][16], down[1 << 16];

void build() {
    for (int i = 0; i < 1 << 16; ++i) {
        for (int j = 0; j < 15; ++j) {
            for (int k = 0; k < 4; ++k) {
                int rm = i >> (k * 4) & 15;
                if ((j + 1) >> k & 1) {
                    rm++;
                }
                if (rm == 16) {
                    nxt[i][j] = -1;
                    break;
                }
                nxt[i][j] |= rm << (k * 4);
            }
        }
        for (int k = 0; k < 4; ++k) {
            int rm = i >> (k * 4) & 15;
            rm >>= 1;
            down[i] |= rm << (k * 4);
        }
    }
}

void upd(ll &i, ll j) {
    i = max(i, j);
}

void solve() {
    int k;
    cin >> k;
    int n = (1 << k) - 1;
    for (int i = 0; i < n; ++i) {
        cin >> c[i];
    }
    for (int i = 0; i < k; ++i) {
        cin >> a[i];
    }
    for (int i = 0; i < 2; ++i) for (int j = 0; j < 1 << k * 4; ++j) {
        dp[i][j] = -1ll << 60;
    }
    dp[0][0] = 0;
    int now = 1;
    for (int bit = 0; bit < 30; ++bit) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < 1 << k * 4; ++j) {
                dp[now][j] = -1ll << 60;
            }
            for (int j = 0; j < 1 << k * 4; ++j) if (dp[now ^ 1][j] >= 0) {
                // place 0
                upd(dp[now][j], dp[now ^ 1][j]);
                // place 1
                assert(nxt[j][i] != -1);
                upd(dp[now][nxt[j][i]], dp[now ^ 1][j] + ((ll)c[i] << bit));
            }
            now ^= 1;
        }
        for (int j = 0; j < 1 << k * 4; ++j) {
            dp[now][j] = -1ll << 60;
        }
        for (int j = 0; j < 1 << k * 4; ++j) if (dp[now ^ 1][j] >= 0) {
            int cur = 0;
            for (int i = 0; i < k; ++i) if (j >> (i * 4) & 1) {
                cur ^= 1 << i;
            }
            for (int i = 0; i < k; ++i) if (a[i] >> bit & 1) {
                cur ^= 1 << i;
            }
            if (cur) {
                continue;
            }
            upd(dp[now][down[j]], dp[now ^ 1][j]);
        }
        now ^= 1;
    }
    cout << dp[now ^ 1][0] << '\n';
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    build();
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}