Rainbow Bracket Sequence

#include <bits/stdc++.h>
using namespace std;
vector<int>a[305],c[305],d[305],e[305];
int pr1[305],pr2[305],l[305],w[305],tot[305],col[205],val[205];
int n,m;
int s,t,flow;
long long ans,res;
void add(int u,int v,int w,int cost)
{
	a[u].push_back(v);
	a[v].push_back(u);
	c[u].push_back(w);
	c[v].push_back(0);
	d[u].push_back(a[v].size()-1);
	d[v].push_back(a[u].size()-1);
	e[u].push_back(cost);
	e[v].push_back(-cost);
}
void update()
{
	int cur=t;
	flow+=l[t];
	while(cur!=s)
	{
		c[pr1[cur]][pr2[cur]]-=l[t];
		c[cur][d[pr1[cur]][pr2[cur]]]+=l[t];
		res=res+1ll*l[t]*e[pr1[cur]][pr2[cur]];
		cur=pr1[cur];
	}
}
long long v[305];
int q[3000005],h[3000005];
bool spfa()
{
	for(int i=0;i<=2*n+m+1;i++)
	{
		v[i]=LLONG_MAX;
	}
	int L,R;
	L=0,R=1;
	q[1]=s;
	v[s]=0;
	l[s]=INT_MAX;
	h[1]=INT_MAX;
	while(L<R)
	{
		L++;
		int n1=q[L];
		for(int i=0;i<a[n1].size();i++)
		{
			if(v[n1]+e[n1][i]<v[a[n1][i]]&&c[n1][i]>0)
			{
				l[a[n1][i]]=min(h[L],c[n1][i]);
				R++;
				q[R]=a[n1][i];
				h[R]=l[a[n1][i]];
				v[a[n1][i]]=v[n1]+e[n1][i];
				pr1[a[n1][i]]=n1;
				pr2[a[n1][i]]=i;
			}
		}
	}
	return v[t]!=LLONG_MAX;
} 
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin>>T;
	while(T--)
	{
		cin>>n>>m;
		s=0,t=2*n+m+1;
		for(int i=0;i<=2*n+m+1;i++)
		{
			a[i].clear();
			c[i].clear();
			d[i].clear();
			e[i].clear();
		}
		add(s,2*n,n,0);
		for(int i=1;i<=m;i++)
		{
			cin>>w[i];
			tot[i]=0;
		}
		for(int i=1;i<=2*n;i++)
		{
			cin>>col[i];
			tot[col[i]]++;
		}
		bool pd=true;
		for(int i=1;i<=m;i++)
		{
			if(tot[i]<w[i])
			{
				pd=false;
			}
			add(2*n+i,t,tot[i]-w[i],0);
		}
		ans=0;
		for(int i=1;i<=2*n;i++)
		{
			cin>>val[i];
			ans+=val[i];
			add(i,2*n+col[i],1,val[i]);
			add(i,i-1,(i-1)/2,0);
		}
		if(pd==false)
		{
			cout<<-1<<endl;
			continue;
		}
		flow=0;
		res=0;
		while(spfa())
		{
			update();
		}
		if(flow!=n)
		{
			cout<<-1<<endl;
		}
		else
		{
			cout<<ans-res<<endl;
		}
	}
	return 0;
}