#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int T; cin >> T;
    while(T--){
        int N,M; cin >> N >> M;
        vector<long long> A(N),B(M),C(N),D(M);
        for(auto &a : A) cin >> a;
        for(auto &b : B) cin >> b;
        for(auto &a : C) cin >> a,a--;
        for(auto &b : D) cin >> b,b--;

        long long answer = -1;
        auto f = [&]() -> void {
            vector<long long> T = B;
            for(int i=1; i<M; i++) T.at(i) += T.at(i-1);
            auto Trange = [&](int l,int r) -> long long {
                long long ret = T.at(r);
                if(l) ret -= T.at(l-1);
                return ret;
            };

            vector<vector<pair<int,long long>>> P(N+M);
            vector<vector<pair<int,int>>> Q(N+M);
            long long sum = 0;
            for(int i=0; i<N; i++){
                sum += A.at(i);
                if(i%2 == 0) P.at(C.at(i/2)).push_back({i/2,sum});
            }
            for(int i=0; i<M; i++) Q.at(D.at(i)).push_back({min(i,M-1-i),i});
            
            for(int t=0; t<N+M; t++) if(P.at(t).size() && Q.at(t).size()){
                auto &p = P.at(t);
                auto &q = Q.at(t);
                sort(q.begin(),q.end());
                int n = p.size(),m = q.size(),pos = 0;
                p.push_back({1001001,-1});
                for(int i=0; i<n; i++){
                    auto [len,s] = p.at(i);
                    auto [len2,ign] = p.at(i+1);
                    while(pos < m){
                        auto [ok,mid] = q.at(pos);
                        if(ok < len){pos++; continue;}
                        else if(ok < len2){
                            long long now = s+Trange(mid-len,mid+len);
                            answer = max(answer,now),pos++;
                        }
                        else break;
                    }
                }
            }


        };
        f();
        reverse(A.begin(),A.end());
        reverse(B.begin(),B.end());
        reverse(C.begin(),C.end());
        reverse(D.begin(),D.end());
        f();
        swap(N,M),swap(A,B),swap(C,D);
        f();
        reverse(A.begin(),A.end());
        reverse(B.begin(),B.end());
        reverse(C.begin(),C.end());
        reverse(D.begin(),D.end());
        f();
        cout << answer << "\n";
    }
}