#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n;
    std::cin >> n;
    
    std::vector<int> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    
    int m;
    std::cin >> m;
    
    std::vector<int> h(m);
    for (int i = 0; i < m; i++) {
        std::cin >> h[i];
    }
    
    std::vector pre(n + 1, std::array<int, 3>{});
    for (int i = 0; i < n; i++) {
        pre[i + 1] = pre[i];
        pre[i + 1][a[i] - 1]++;
    }
    
    auto ans = *std::ranges::partition_point(std::ranges::iota_view(0LL, i64(1E14)),
        [&](i64 t) {
            i64 cnt1 = t / n * pre[n][0] + pre[t % n][0];
            i64 cnt2 = t / n * pre[n][1] + pre[t % n][1];
            i64 cnt3 = t / n * pre[n][2] + pre[t % n][2];
            
            auto a = h;
            for (int i = 0; i < m; i++) {
                if (a[i] % 2 == 1 && a[i] >= 3 && cnt3 > 0) {
                    cnt3--;
                    a[i] -= 3;
                }
            }
            for (int i = 0; i < m; i++) {
                int v = std::min(1LL * a[i] / 6, cnt3 / 2);
                a[i] -= v * 6;
                cnt3 -= v * 2;
            }
            for (int i = 0; i < m; i++) {
                if (a[i] >= 3 && cnt3 > 0) {
                    cnt3--;
                    a[i] -= 3;
                }
            }
            for (int i = 0; i < m; i++) {
                if (a[i] == 2 && cnt3 > 0) {
                    cnt3--;
                    a[i] -= 2;
                }
            }
            for (int i = 0; i < m; i++) {
                if (a[i] == 1 && cnt3 > 0) {
                    cnt3--;
                    a[i] -= 1;
                }
            }
            
            i64 sum = std::accumulate(a.begin(), a.end(), 0LL);
            int odd = 0;
            for (int i = 0; i < m; i++) {
                odd += (a[i] % 2);
            }
            
            if (cnt1 + 2 * cnt2 >= sum + std::max(0LL, odd - cnt1)) {
                return false;
            }
            return true;
        });
    std::cout << ans << "\n";
}

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