//teja349
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
//setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//setfill -   cout << setfill ('x') << setw (5); cout << 77 << endl; prints xxx77
//setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
//cout.precision(x)  cout<<fixed<<val;  // prints x digits after decimal in val

using namespace std;
using namespace __gnu_pbds;

#define f(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define vl vector< ll >
#define ss second
#define ff first
#define ll long long
#define pii pair< int,int >
#define pll pair< ll,ll >
#define sz(a) a.size()
#define inf (1000*1000*1000+5)
#define all(a) a.begin(),a.end()
#define tri pair<int,pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define mod (1000*1000*1000+7)
#define pqueue priority_queue< int >
#define pdqueue priority_queue< int,vi ,greater< int > >
#define flush fflush(stdout) 
#define primeDEN 727999983
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define int ll
// find_by_order()  // order_of_key
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

int seg[4123456],lazy[4123456];
struct total{
	int tim,bus;
	int a[4];
};
total arr[1234567];
int dp[1234567];
ll iinf;
int query(int node,int s,int e,int l,int r){
	// if(seg[node]<0) 
	// 	cout<<"das"<<endl;
	if(lazy[node]){
		seg[node]+=lazy[node];
		if(s!=e){
			lazy[2*node]+=lazy[node];
			lazy[2*node+1]+=lazy[node];
		}
		lazy[node]=0;
	}
	if(e<l || r<s){
		return iinf;
	}
	if(l<=s && e<=r){
		return seg[node];
	}
	int mid=(s+e)/2;
	int val=query(2*node,s,mid,l,r);
	val=min(val,query(2*node+1,mid+1,e,l,r));
	return val;
}
int update(int node,int s,int e,int l,int r,int val){
	if(lazy[node]){
		seg[node]+=lazy[node];
		if(s!=e){
			lazy[2*node]+=lazy[node];
			lazy[2*node+1]+=lazy[node];
		}
		lazy[node]=0;
	}
	if(e<l || r<s){
		return 0;
	}
	if(l<=s && e<=r){
		lazy[node]+=val;
		seg[node]+=lazy[node];
		if(s!=e){
			lazy[2*node]+=lazy[node];
			lazy[2*node+1]+=lazy[node];
		}
		lazy[node]=0;
		return 0;
	}
	int mid=(s+e)/2;
	update(2*node,s,mid,l,r,val);
	update(2*node+1,mid+1,e,l,r,val);
	seg[node]=min(seg[2*node],seg[2*node+1]);
	return 0;
}
int build(int node,int s,int e){
	seg[node]=0;
	lazy[node]=0;
	if(s==e)
		return 0;
	int mid=(s+e)/2;
	build(2*node,s,mid);
	build(2*node+1,mid+1,e);
	return 0;
}
int comp(total a,total b){
	return a.tim<b.tim;
}
int nexti[1234567],st[1234567],en[1234567];
vector<vi> remover(1234567);
signed main(){
    std::ios::sync_with_stdio(false); cin.tie(NULL);
  	int t;
  	cin>>t;
  	while(t--){
  		int m,i;
  		cin>>m;
  		iinf=inf;
  		iinf*=inf;
  		rep(i,m){
  			cin>>arr[i].tim;
  			arr[i].bus=1;
  		}
  		arr[m].tim=-inf;
  		arr[m].bus=1;
  		m++;
  		int n;
  		cin>>n;
  		f(i,m,n+m){
  			cin>>arr[i].tim;
  			arr[i].bus=0;
  		}
  		rep(i,n+m){
  			remover[i].clear();
  		}
  		build(1,0,n+m);
  		int j,k;
  		rep(j,4){
  			f(i,m,m+n){
  				cin>>arr[i].a[j];
  			}
  		}
  		sort(arr,arr+n+m,comp);
  		vi vec;
  		rep(i,n+m){
  			vec.pb(arr[i].tim);
  		}
  		int lol;
  		rep(i,n+m){
  			if(arr[i].bus)
  				continue;
  			nexti[i]=lower_bound(all(vec),arr[i].tim+arr[i].a[2])-vec.begin();
  			lol=upper_bound(all(vec),arr[i].tim-arr[i].a[0])-vec.begin();
  			remover[lol].pb(i);
  			//cout<<arr[i].tim<<"  "<<lol<<endl;
  		}
  		int goo,boo;
  		dp[n+m-1]=0;
  		goo=n+m-1;
  		fd(i,n+m-1,0){
  			if(arr[i].bus){
  				boo=i;
  				break;
  			}
  		}
  		fd(j,i-1,0){
  			st[j]=boo;
  			en[j]=goo;
  			if(arr[j].bus){
  				goo=boo-1;
  				boo=j;
  			}
  		}

  		fd(j,n+m-2,i){
  			dp[j]=iinf;
  			update(1,0,n+m,j,j,iinf);
  		}
  		int ind;
  		fd(j,n+m-1,i){
  			if(!arr[j].bus){
  				if(nexti[j]!=n+m)
  					update(1,0,n+m,nexti[j],n+m-1,arr[j].a[3]);
  				//cout<<arr[j].a[1]<<endl;
  				update(1,0,n+m,j,n+m-1,arr[j].a[1]);
  				//cout<<j<<" "<<n+m-1<<" "<<arr[j].a[1]<<endl;
  			}
  			rep(k,remover[j].size()){
  				ind=remover[j][k];
  				update(1,0,n+m,ind,n+m-1,-1*arr[ind].a[1]);
  				//cout<<ind<<" "<<n+m-1<<" "<<-1*arr[ind].a[1]<<endl;
  			}
  		}

  		fd(j,i-1,0){
  			dp[j]=query(1,0,n+m,st[j],en[j]);
  			//cout<<dp[j]<<endl;
  			update(1,0,n+m,j,j,dp[j]);
  			//cout<<j<<" "<<dp[j]<<" "<<st[j]<<" "<<en[j]<<endl;
  			if(!arr[j].bus){
  				if(nexti[j]!=n+m)
  					update(1,0,n+m,nexti[j],n+m-1,arr[j].a[3]);
  				update(1,0,n+m,j,n+m-1,arr[j].a[1]);
  				//cout<<j<<" "<<n+m-1<<" "<<arr[j].a[1]<<endl;
  			}
  			rep(k,remover[j].size()){
  				ind=remover[j][k];
  				update(1,0,n+m,ind,n+m-1,-1*arr[ind].a[1]);
  				//cout<<ind<<" "<<n+m-1<<" "<<-1*arr[ind].a[1]<<endl;
  			}
  		}
  		cout<<dp[0]<<endl;
  	}
    return 0;   
}