#pragma GCC optimize("O3")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

int sign(vector<int> p) {
    int res = 1;
    for (int i = 0; i < (int)p.size(); i++) {
        if (i != p[i]) {
            swap(p[i], p[p[i]]);
            res = -res;
        }
    }
    return res;
}

int getDet(int k, const vector<int>& masks) {
    vector<int> p(k);
    iota(p.begin(), p.end(), 0);
    int ans = 0;
    do {
        int mul = 1;
        for (int i = 0; i < k; i++) {
            if (((masks[i] >> p[i]) & 1) == 0) {
                mul = 0;
                break;
            }
        }
        if (mul == 1) {
            ans += sign(p);
        }
    } while (next_permutation(p.begin(), p.end()));
    return ans;
}

void check() {
    int k;
    cin >> k;
    int best = 0;
    int cnt = 0;
    for (int mask = 0; mask < (1 << (1 << k)); mask += 2) {
        if (__builtin_popcount(mask) == k) {
            vector<int> masks;
            for (int i = 0; i < (1 << k); i++) {
                if ((mask >> i) & 1) {
                    masks.emplace_back(i);
                }
            }
            int cur = getDet(k, masks);
            if (cur == 0) {
                continue;
            }
            for (int i : masks) {
                for (int j = 0; j < k; j++) {
                    cerr << ((i >> j) & 1);
                }
                cerr << "\n";
            }
            cerr << cur << "\n";
            best = max(best, abs(cur));
            cnt++;
        }
    }
    cerr << best << " " << cnt << "!!!\n";
}

map<vector<int>, vector<vector<int>>> cache[5];

vector<vector<int>> inv(int k, const vector<int>& masks) {
    auto it = cache[k].find(masks);
    if (it != cache[k].end()) {
        return it->second;
    }
    vector<vector<int>> ans(k, vector<int>(k, 0));
    for (int i = 0; i < k; i++) {
        for (int j = 0; j < k; j++) {
            vector<int> new_masks;
            for (int t = 0; t < k; t++) {
                if (t != j) {
                    int cur = masks[t] & ((1 << i) - 1);
                    cur += (masks[t] >> (i + 1)) << i;
                    new_masks.emplace_back(cur);
                }
            }
            ans[j][i] = getDet(k - 1, new_masks);
            if ((i + j) % 2 == 1) {
                ans[j][i] *= -1;
            }
        }
    }
    return (cache[k][masks] = ans);
}

void solve() {
    int k;
    cin >> k;
    vector<int> c((1 << k), 0);
    for (int i = 1; i < (1 << k); i++) {
        cin >> c[i];
    }
    vector<int> a(k, 0);
    for (int i = 0; i < k; i++) {
        cin >> a[i];
    }
    ll ans = 0;
    for (int mask = 0; mask < (1 << (1 << k)); mask += 2) {
        if (__builtin_popcount(mask) == k) {
            vector<int> masks;
            for (int i = 0; i < (1 << k); i++) {
                if ((mask >> i) & 1) {
                    masks.emplace_back(i);
                }
            }
            int cur = getDet(k, masks);
            if (cur == 0) {
                continue;
            }
            ll add = 0;
            //cerr << add << "!!!!!!!!!!\n";
            auto cur_inv = inv(k, masks);

            /*for (int i : masks) {
                for (int j = 0; j < k; j++) {
                    cerr << ((i >> j) & 1);
                }
                cerr << "\n";
            }
            cerr << cur << "\n";
            for (int i = 0; i < k; i++) {
                for (int j = 0; j < k; j++) {
                    cerr << cur_inv[i][j] << " ";
                }
                cerr << "\n";
            }
            cerr << "\n";*/

            bool ok = true;
            vector<ll> cur_x(k, 0);
            for (int i = 0; i < k; i++) {
                for (int j = 0; j < k; j++) {
                    cur_x[i] += (ll)cur_inv[i][j] * (a[j] / abs(cur));
                }
                if (cur < 0) {
                    cur_x[i] *= -1;
                }
                if (cur_x[i] < 0) {
                    ok = false;
                    break;
                }
            }
            if (ok) {
                if (abs(cur) > 1) {
                    vector<int> delta(a);
                    for (int i = 0; i < k; i++) {
                        delta[i] %= abs(cur);
                    }
                    map<vector<int>, ll> best;
                    best[delta] = 0;
                    for (int i = 1; i < (1 << k); i++) {
                        map<vector<int>, ll> cur_best = best;
                        for (auto t : best) {
                            vector<int> new_t(t.first);
                            bool stop = false;
                            for (int u = 0; u < 10; u++) {
                                for (int x = 0; x < k; x++) {
                                    if ((i >> x) & 1) {
                                        new_t[x]--;
                                        if (new_t[x] < 0) {
                                            stop = true;
                                            break;
                                        }
                                    }
                                }
                                if (stop) {
                                    break;
                                }
                                cur_best[new_t] = max(cur_best[new_t], t.second + (u + 1) * c[i]);
                            }
                        }
                        swap(best, cur_best);
                    }
                    add = best[vector<int>(k, 0)];
                }

                for (int i = 0; i < k; i++) {
                    add += (ll)c[masks[i]] * cur_x[i];
                }
                ans = max(ans, add);
            }
        }
    }
    cout << ans << "\n";
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        double start_time = TIME;
        solve();
        cerr << (TIME - start_time) << "\n";
    }

    return 0;
}