#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
#ifdef Doludu
template <typename T>
ostream& operator << (ostream &o, vector <T> vec) {
    o << "{"; int f = 0;
    for (T i : vec) o << (f++ ? " " : "") << i;
    return o << "}";
}
void bug__(int c, auto ...a) {
    cerr << "\e[1;" << c << "m";
    (..., (cerr << a << " "));
    cerr << "\e[0m" << endl;
}
#define bug_(c, x...) bug__(c, __LINE__, "[" + string(#x) + "]", x)
#define bug(x...) bug_(32, x)
#define bugv(x...) bug_(36, vector(x))
#define safe bug_(33, "safe")
#else
#define bug(x...) void(0)
#define bugv(x...) void(0)
#define safe void(0)
#endif
const int mod = 998244353, N = 300005;

void solve() {
    int n, m;
    cin >> n >> m;
    vector <int> a(n), b(m), c(n), d(m);
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int i = 0; i < m; ++i) cin >> b[i];
    for (int i = 0; i < n; ++i) cin >> c[i], --c[i];
    for (int i = 0; i < m; ++i) cin >> d[i], --d[i];

    ll ans = -1;
    auto solve = [&]() {
        vector <vector <pair <int, ll>>> eve(n + m);
        vector <ll> pre1(n + 1), pre2(m + 1);
        for (int i = 1; i <= n; ++i) pre1[i] = pre1[i - 1] + a[i - 1];
        for (int i = 1; i <= m; ++i) pre2[i] = pre2[i - 1] + b[i - 1];
        for (int i = 0; i * 2 < n; ++i) {
            eve[c[i]].emplace_back(i, pre1[2 * i + 1]);
        }
        for (int i = 0; i < m; ++i) {
            int mn = min(i, m - i - 1);
            auto it = lower_bound(all(eve[d[i]]), pair(mn + 1, -1ll));
            if (it == eve[d[i]].begin()) continue;
            auto [cur, val] = *prev(it);
            ans = max(ans, val + pre2[i + cur + 1] - pre2[i - cur]);
        }
    };

    solve();
    reverse(all(a)), reverse(all(c));
    solve();
    reverse(all(a)), reverse(all(c));
    swap(a, b), swap(n, m), swap(c, d);
    solve();
    reverse(all(a)), reverse(all(c));
    solve();

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

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