#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T;
int N,M;
ll maR[404040],maC[404040];
ll As[202020],Bs[202020];
vector<int> cand[404040];

ll hoge(vector<int> A,vector<int> B,vector<int> C,vector<int> D) {
	int N=A.size(),M=B.size();
	int i,j;
	ll ret=-1;
	FOR(i,N) {
		As[i+1]=As[i]+A[i];
		cand[C[i]].push_back(i);
	}
	FOR(i,M) Bs[i+1]=Bs[i]+B[i];
	FOR(i,M) {
		int p=lower_bound(ALL(cand[D[i]]),min({i,M-1-i,(N-1)/2})+1)-cand[D[i]].begin();
		if(p) {
			p=cand[D[i]][p-1];
			ret=max(ret,As[2*p+1]+Bs[i+p+1]-Bs[i-p]);
		}
	}
	
	FOR(i,N+M) cand[i].clear();
	return ret;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>N>>M;
		vector<int> A(N),B(M),C(N),D(M);
		FOR(i,N) cin>>A[i];
		FOR(i,M) cin>>B[i];
		FOR(i,N) {
			cin>>C[i];
			C[i]--;
		}
		FOR(i,M) {
			cin>>D[i];
			D[i]--;
		}
		ll ret=-1;
		ret=max(ret,hoge(A,B,C,D));
		ret=max(ret,hoge(B,A,D,C));
		reverse(ALL(A));
		reverse(ALL(B));
		reverse(ALL(C));
		reverse(ALL(D));
		ret=max(ret,hoge(A,B,C,D));
		ret=max(ret,hoge(B,A,D,C));
		cout<<ret<<endl;
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}