#include<bits/stdc++.h>
#define int long long
#define fr(i,a,b) for(int i(a),end##i(b);i<=end##i;i++)
#define fd(i,a,b) for(int i(a),end##i(b);i>=end##i;i--)
using namespace std;
const int maxn=1e6+5,inf=1e17;
int nex[maxn],head[maxn],to[maxn],w[maxn],cost[maxn];

int n,s,t;
int e=1;
void add(int x,int y,int z,int c){
	nex[++e]=head[x];
	head[x]=e;
	to[e]=y;w[e]=z;cost[e]=c;
}
void insert(int x,int y,int z,int c){
	add(x,y,z,c);
	add(y,x,0,-c);
}


int L[maxn];
vector<int> C[2000+5];
int V[maxn];
int m;
bool pd[maxn];
int d[maxn],q[maxn],flow[maxn],pre[maxn];
bool spfa(){
	int f=1,l=0;
	fr(i,1,n)d[i]=inf,pd[i]=0;
	d[s]=0;pd[s]=1;flow[s]=inf;
	q[++l]=s;
	while(f<=l){
		int x=q[f++];
		for(int i=head[x];i;i=nex[i])if(w[i]>0&&d[to[i]]>d[x]+cost[i]){
			d[to[i]]=d[x]+cost[i];
			pre[to[i]]=i;
			flow[to[i]]=min(flow[x],w[i]);
			if(!pd[to[i]])q[++l]=to[i],pd[to[i]]=1;
		}
		pd[x]=0;
	}
	if(d[t]>inf/2)return 0;
	return 1;
}
int sf=0,sc=0;
void up(){
	int x=t;
	while(x){
		w[pre[x]]-=flow[t];
		w[pre[x]^1]+=flow[t];
		x=to[pre[x]^1];
	}
	sf+=flow[t];
	sc+=flow[t]*d[t];
}
void solve(){
	int n;
	e=1;sf=sc=0;
	scanf("%lld%lld",&n,&m);
	s=2*n+m+1;t=2*n+m+3;int T=t-1;
	::n=t;
	fr(i,1,t)head[i]=0;
	fr(i,1,m)C[i].clear();

	fr(i,1,m)scanf("%lld",&L[i]);

	fr(i,1,2*n){
		int x;scanf("%lld",&x);
		C[x].push_back(2*n-i+1);
	}

	int sum=0;
	fr(i,1,2*n){
		scanf("%lld",&V[i]);
		sum+=V[i];
	}
	reverse(V+1,V+2*n+1);

	fr(i,1,m){  
		int u=((int)C[i].size());
		if(u-L[i]<0){
			cout<<-1<<'\n';
			return ;
		}
		insert(s,i+2*n,u-L[i],0);
		for(auto j:C[i]){
			insert(i+2*n,j,1,V[j]);
		}
	}

	fr(i,1,2*n-1)insert(i,i+1,t,0);
	fr(i,1,2*n)if((i&1))insert(i,T,1,0);
	insert(T,t,n,0);

	while(spfa()){
		up();
	}
	//cout<<sf<<'\n';
	if(sf!=n)cout<<-1<<'\n';
	else cout<<sum-sc<<'\n';
}
signed main(){
#ifdef pig
	freopen("pig.in","r",stdin);
	freopen("pig.out","w",stdout);
#endif
	int t;cin>>t;
	while(t--)solve();

	return 0;
}