#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 200
const ll inf=1e17+7;
signed main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	void solve();
	int t=1;
	cin>>t;
    while(t--)solve();
    return 0;
}
ll max_flow=0,min_cost=0;
ll n,m,s,t,tot;
ll k[N<<3],val[N<<3],col[N<<3],dis[N<<3];
struct node{int nex;ll v;ll w;ll c;}a[N<<8];
int head[N<<3]={0},cnt=1,pre[N<<3],x[N<<3];
void add(ll u,ll v,ll w,ll c)
{
	a[++cnt]=(node){head[u],v,w,c};
	head[u]=cnt;
	a[++cnt]=(node){head[v],u,0,-c};
	head[v]=cnt;
}
bool spfa()
{
	vector<int> vis(tot+10,0);
	for(int i=1;i<=tot;i++)dis[i]=inf;
	queue<int> q;
	vis[s]=1;
	dis[s]=0;
	q.push(s);
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		ll w=dis[u];
		vis[u]=0;
		for(int i=head[u];i;i=a[i].nex)
		{
			int v=a[i].v;
			ll tw=a[i].c;
			if(a[i].w<=0||tw+w>=dis[v])continue;
			dis[v]=tw+w;
			if(!vis[v])
			{
				vis[v]=1;
				q.push(v);
			}
			pre[v]=u;
			x[v]=i;
		}
	}
	return dis[t]!=inf;
}
void ek()
{
	ll minn=inf;
	for(int p=t;p!=s;p=pre[p])
	{
		minn=min(minn,a[x[p]].w);
	}
	for(int p=t;p!=s;p=pre[p])
	{
		a[x[p]].w-=minn;
		a[x[p]^1].w+=minn;
	}
	min_cost+=minn*dis[t];
	max_flow+=minn;
}
void solve()
{
	bool flag=false;
	
	cin>>n>>m;
	s=2*n+m+1;
	t=2*n+m+2;
	tot=t;
	max_flow=0;
	min_cost=0;
	cnt=1;
	for(int i=1;i<=tot;i++)head[i]=0;
	ll sum=0;
	for(int i=1;i<=m;i++)
	{
		cin>>k[i];
		sum+=k[i];
		k[i]=-k[i];
	}
//	sum--;
	if(sum>n)flag=true;
	for(int i=1;i<=2*n;i++)
	{
		cin>>col[i];
		k[col[i]]++;
	}
	sum=0;
	for(int i=1;i<=2*n;i++)
	{
        cin>>val[i];
		sum+=val[i];
	}
	if(flag)
	{
		cout<<-1<<"\n";
		return ;
	}
	add(s,2*n,n,0);
	for(int i=2*n;i>1;i--)
	{
		add(i,i-1,(i-1)>>1,0);
		add(i,col[i]+2*n,1,val[i]);
	}
	for(int i=1;i<=m;i++)
	{
		add(2*n+i,t,k[i],0);
	}
	while(spfa())ek();
	cout<<sum-min_cost<<"\n";
}