#include<random>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<ctime>
#include<cctype>
#include<cstdio>
#include<cstdlib>
#include<climits>
//#define NDEBUG
#include<cassert>
#include<cstring>
#include<complex>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<bitset>
//#define LL __int128
#define LL long long
#define ULL unsigned LL
#define uint unsigned int
//#define int LL
//#define double long double
#define mkp make_pair
#define par pair<int,int>
#define psb push_back
#define epb emplace_back
#define f(x) ((x).first)
#define s(x) ((x).second)
using namespace std;
#define Lbt(x) ((x)&(-(x)))
#define Swap(x,y) (x^=y^=x^=y)
const int Mxxx=1e5;
inline char gc()
{
//	return getchar();
	static char buf[Mxxx],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxxx,stdin),p1==p2)?EOF:*p1++;
}
inline char pc(char ch,bool fl=false)
{
//	return fl?0:putchar(ch),0;
	static char buf[Mxxx],*p1=buf,*p2=buf+Mxxx;
	return (fl||((*p1++=ch)&&p1==p2))&&(fwrite(buf,1,p1-buf,stdout),p1=buf),0;
}
#define output pc('!',true)
inline int read()
{
	char ch=gc();
	int gans=0,gflag=0;
	for(;ch<'0'||'9'<ch;gflag|=ch=='-',ch=gc());
	for(;'0'<=ch&&ch<='9';gans=(gans<<1)+(gans<<3)+(ch^48),ch=gc());
	return gflag?-gans:gans;
}
template<typename T>
inline char read(T&gans)
{
	char ch=gc();
	int gflag=0;gans=0;
	for(;ch<'0'||'9'<ch;gflag|=ch=='-',ch=gc());
	for(;'0'<=ch&&ch<='9';gans=(gans<<1)+(gans<<3)+(ch^48),ch=gc());
	return gans=gflag?-gans:gans,ch;
}
template<typename T>
inline void write(T x)
{
	if(x>9)write(x/10);
	pc(x%10^48);
}
template<typename T>
inline void writenum(T x,char ch)
{
	if(x<0)pc('-'),x=-x;
	write(x);pc(ch);
}
inline void writechar(char x,char ch)
{
	pc(x);pc(ch);
}
template<typename T>
inline T Max(T x,T y)
{
	return x>y?x:y;
}
template<typename T>
inline T Min(T x,T y)
{
	return x<y?x:y;
}
template<typename T>
inline T Abs(T x)
{
	return x<0?-x:x;
}
template<typename T>
inline void ckmx(T&x,T y)
{
	x=Max(x,y);
}
template<typename T>
inline void ckmn(T&x,T y)
{
	x=Min(x,y);
}
namespace Wll
{
	const int Mx=5e3,M=5e4;
	int tot,cnt,h[Mx+5],nxt[(M<<1)+5],tto[(M<<1)+5],val[(M<<1)+5],cst[(M<<1)+5];
	inline void Pre(int x)
	{
		tot=x,cnt=1;for(int i=1;i<=tot;i++)h[i]=0;
	}
	inline void ade(int x,int y,int v,int c)
	{
		nxt[++cnt]=h[x];
		tto[h[x]=cnt]=y;
		val[cnt]=v;cst[cnt]=c;
	}
	inline void Ade(int x,int y,int v,int c)
	{
		ade(x,y,v,c);ade(y,x,0,-c);
	}
	int fst[Mx+5];
	inline void Pre(){for(int i=1;i<=tot;i++)fst[i]=h[i];}
	deque<int>q;int ds[Mx+5];int vis[Mx+5];LL dst[Mx+5];
	inline int Spfa(int s,int t)
	{
		int i,x,to;
		for(i=1;i<=tot;i++)h[i]=fst[i],ds[i]=INT_MAX,dst[i]=LLONG_MAX;
		for(vis[s]=1,ds[s]=dst[s]=0,q.psb(s);!q.empty();)
		{
			x=q.front();q.pop_front();vis[x]=0;
			for(i=h[x];i;i=nxt[i])if(val[i]&&(dst[to=tto[i]]>dst[x]+cst[i]))
			{
				dst[to]=dst[x]+cst[i];ds[to]=ds[x]+1;
				if(!vis[to])
				{
					vis[to]=1;if(!q.empty()&&dst[to]<dst[q.front()])q.push_front(to);else q.psb(to);
				}
			}
		}return ds[t]^INT_MAX;
	}
	inline int DFS(int x,int y,int z)
	{
		if(x==z)return y;
		int k,to,sm=0;
		for(int&i=h[x];i;i=nxt[i])if(val[i]&&ds[to=tto[i]]==ds[x]+1&&dst[to]==dst[x]+cst[i])
		{
			if(!(k=DFS(to,Min(y,val[i]),z))){ds[to]=INT_MAX;continue;}
			val[i]-=k;val[i^1]+=k;if(!(sm+=k,y-=k))return sm;
		}return sm;
	}
	LL sum;
	inline int McMf(int s,int t)
	{
		int k,sm=0;for(Pre();Spfa(s,t);sm+=(k=DFS(s,INT_MAX,t)),sum+=k*dst[t]);return sm;
	}
}
int TT;
const int Mx=1e2;
int n,m,nn,S,T,c[Mx+5],v[Mx+5],lmt[Mx+5],tot[Mx+5];LL sum;
signed main()
{
	#ifndef ONLINE_JUDGE
	freopen("_.in","r",stdin);
//	freopen("_.out","w",stdout);
	#endif
	int i,f;
	for(TT=read();TT;TT--)
	{
		n=read();m=read();nn=n<<1;sum=Wll::sum=0;
		S=nn+m+1;Wll::Pre(T=S+1);
		for(i=1;i<=m;i++)lmt[i]=read(),tot[i]=0;
		for(i=1;i<=nn;i++)tot[c[i]=read()]++;
		for(i=1;i<=nn;i++)sum+=(v[i]=read());
		for(f=i=1;i<=m;i++)if(lmt[i]>tot[i])f=0;
		for(i=1;i<=m;i++)Wll::Ade(S,i,tot[i]-lmt[i],0);
		for(i=1;i<=nn;i++)Wll::Ade(c[i],m+i,1,v[i]);
		for(i=1;i<nn;i++)Wll::Ade(m+i+1,m+i,n,0);
		for(i=2;i<=nn;i+=2)Wll::Ade(m+i,T,1,0);
		if(!f||Wll::McMf(S,T)<n)writenum(-1,10);
		else writenum(sum-Wll::sum,10);
	}
	return output;
}
/*
2
3 2
1 2
1 2 2 2 1 2
3 1 4 2 2 1
3 2
2 2
1 2 2 2 1 2
3 1 4 2 2 1
*/