#include <bits/stdc++.h>


using namespace std;

using ll = long long;
using ld = long double;

#define len(a) ((int)(a).size())
#define rep(i, n) for(int i = 0; i < (n); i += 1)

const ll INF = 1'000'000'000'000'000'000;

mt19937 rnd(234);
vector<ll> cs, as;
int k;

ll rec(ll it) {
    if (it == 0) {
        bool flag = true;
        for (int i = 0; i < k; ++i) flag &= (as[i] == 0);
        if (flag) return 0;
        return -INF;
    }
    ll bst = -INF;
    for (int i = 1; i < cs.size(); ++i) {
        ll mn = INF;
        for (int j = 0; j < k; ++j) {
            if ((i >> j) & 1) {
                mn = min(mn, as[j]);
            }
        }

        assert(mn != INF);
        if (mn != 0) {
            for (int j = 0; j < k; ++j) {
                if ((i >> j) & 1) as[j] -= mn;
            }
            bst = max(bst, rec(it - 1) + cs[i] * mn);
            for (int j = 0; j < k; ++j) {
                if ((i >> j) & 1) as[j] += mn;
            }
        }
    }

    return bst;
}

void solve() {
    cin >> k;
    cs.resize((1 << k) - 1);
    as.resize(k);
    for (auto& c : cs) cin >> c;
    cs.insert(cs.begin(), 0);
    for (auto& c : as) cin >> c;

    ll ans = rec(k);

    cout << ans << "\n";
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }

    int t;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}