#include <iostream>
#include <vector>
#include <ranges>
#include <cassert>
#include <algorithm>
using namespace std;
using ll=long long;
int main(){
	int T;
	cin>>T;
	assert(1<=T&&T<=200000);
	ll nsum=0,msum=0;
	while(T--){
		int n,m;
		cin>>n>>m;
		assert(1<=n&&n<=200000);
		assert(1<=m&&m<=200000);
		nsum+=n;msum+=m;
		vector<ll> 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];
		for(int i=0;i<m;i++)cin>>d[i];
		{
			for(int i=0;i<n;i++){
				assert(1<=a[i]&&a[i]<=1000000000);
				assert(1<=c[i]&&c[i]<=n+m);
				c[i]--;
			}
			for(int i=0;i<m;i++){
				assert(1<=b[i]&&b[i]<=1000000000);
				assert(1<=d[i]&&d[i]<=n+m);
				d[i]--;
			}
		}
		auto f=[](vector<ll> a,vector<ll> b,vector<ll> c,vector<ll> d)->ll{
			int n=a.size(),m=b.size();
			vector<ll> asum(n+1),bsum(m+1);
			for(int i=0;i<n;i++)asum[i+1]=asum[i]+a[i];
			for(int i=0;i<m;i++)bsum[i+1]=bsum[i]+b[i];
			vector<vector<int>> idx(n+m);
			for(int i=0;i<n;i++)idx[c[i]].push_back(i);
			ll res=-1;
			for(int j=0;j<m;j++){
				auto itr=ranges::upper_bound(idx[d[j]],min({j,m-1-j,(n-1)/2}));
				if(itr!=idx[d[j]].begin()){
					int i=*(itr-1);
					res=max(res,asum[2*i+1]+(bsum[j+i+1]-bsum[j-i]));
				}
			}
				
			return res;
		};
		ll ans=f(a,b,c,d);
		ranges::reverse(a);
		ranges::reverse(c);
		ans=max(ans,f(a,b,c,d));
		swap(a,b);
		swap(c,d);
		ans=max(ans,f(a,b,c,d));
		ranges::reverse(a);
		ranges::reverse(c);
		ans=max(ans,f(a,b,c,d));
		cout<<ans<<'\n';
	}
	assert(nsum<=200000);
	assert(msum<=200000);
}