#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 = 998244353, N = 100005;

struct Simplex {
    using T = long double;
    static const int N = 16, M = 8;
    const T eps = 1e-8;
    int n, m;
    int Left[M], Down[N];
    T a[M][N], b[M], c[N], v, sol[N];
    bool eq(T a, T b) {return fabs(a - b) < eps;}
    bool ls(T a, T b) {return a < b && !eq(a, b);}
    void init(int _n, int _m) {
        n = _n, m = _m, v = 0;
        for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) {
            a[i][j] = 0;
        }
        for (int i = 0; i < m; ++i) {
            b[i] = 0;
        }
        for (int i = 0; i < n; ++i) {
            c[i] = sol[i] = 0;
        }
    }
    void pivot(int x, int y) {
        swap(Left[x], Down[y]);
        T k = a[x][y]; a[x][y] = 1;
        vector <int> nz;
        for (int i = 0; i < n; ++i) {
            a[x][i] /= k;
            if (!eq(a[x][i], 0)) {
                nz.pb(i);
            }
        }
        b[x] /= k;
        for (int i = 0; i < m; ++i) {
            if (i == x || eq(a[i][y], 0)) {
                continue;
            }
            k = a[i][y], a[i][y] = 0;
            b[i] -= k * b[x];
            for (int j : nz) {
                a[i][j] -= k * a[x][j];
            }
        }
        if (eq(c[y], 0)) {
            return;
        }
        k = c[y], c[y] = 0, v += k * b[x];
        for (int i : nz) {
            c[i] -= k * a[x][i];
        }
    }
    int solve() {
        for (int i = 0; i < n; ++i) {
            Down[i] = i; 
        }
        for (int i = 0; i < m; ++i) {
            Left[i] = n + i;
        }
        while (1) {
            int x = -1, y = -1;
            for (int i = 0; i < m; ++i) if (ls(b[i], 0) && (x == -1 || b[i] < b[x])) {
                x = i;
            }
            if (x == -1) {
                break;
            }
            for (int i = 0; i < n; ++i) if (ls(a[x][i], 0) && (y == -1 || a[x][i] < a[x][y])) {
                y = i;
            }
            if (y == -1) return 1;
            pivot(x, y);
        }
        while (1) {
            int x = -1, y = -1;
            for (int i = 0; i < n; ++i) if (ls(0, c[i]) && (y == -1 || c[i] > c[y])) {
                y = i;
            }
            if (y == -1) {
                break;
            }
            for (int i = 0; i < m; ++i) if (ls(0, a[i][y]) && (x == -1 || b[i] / a[i][y] < b[x] / a[x][y])) {
                x = i;
            }
            if (x == -1) {
                return 2;
            }
            pivot(x, y);
        }
        for (int i = 0; i < m; ++i) {
            if (Left[i] < n) {
                sol[Left[i]] = b[i];
            }
        }
        return 0;
    }
} solver;

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        int k;
        cin >> k;
        int n = (1 << k) - 1;
        solver.init(n, k * 2);
        vector <int> c(n);
        for (int i = 0; i < n; ++i) {
            cin >> c[i];
            solver.c[i] = c[i]; 
        }
        vector <int> a(k);
        for (int i = 0; i < k; ++i) {
            cin >> a[i];
            for (int j = 0; j < n; ++j) {
                solver.a[i * 2][j] = ((j + 1) >> i & 1 ? 1 : 0);
                solver.a[i * 2 + 1][j] = ((j + 1) >> i & 1 ? -1 : 0);
                solver.b[i * 2] = a[i];
                solver.b[i * 2 + 1] = a[i];
            }
        }
        int x = solver.solve();
        assert(x == 0);
        vector <ll> res(n);
        for (int i = 0; i < n; ++i) {
            res[i] = solver.sol[i];
        }
        vector <ll> cur(n - k, -1);
        ll best = 0;
        while (true) {
            int now = 0;
            vector <ll> nxt = res;
            for (int i = 0; i < n; ++i) {
                if (i == 0 || i == 1 || i == 3 || i == 7) {
                    continue;
                }
                nxt[i] += cur[now], now++;
            }
            for (int i = 0; i < k; ++i) {
                int j = (1 << i) - 1;
                ll tot = 0;
                for (int x = 0; x < n; ++x) if ((x + 1) >> i & 1 && x != j) {
                    tot += nxt[x];
                }
                nxt[j] = a[i] - tot;
            }
            if (*min_element(all(nxt)) >= 0) {
                ll ans = 0;
                for (int i = 0; i < n; ++i) {
                    ans += c[i] * nxt[i];
                }
                best = max(best, ans);
            }
            int pt = n - k - 1;
            while (~pt && cur[pt] == 1) {
                cur[pt] = -1, --pt;
            }
            if (pt == -1) {
                break;
            }
            cur[pt]++;
        }
        cout << best << '\n';
    }
}