#include<bits/stdc++.h>
#define int long long
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ls (x<<1)
#define rs (x<<1|1)
#define db double
#define inf 2147483647
#define llinf 9223372036854775807
#define ll long long
#define ull unsigned long long
using namespace std;
int inline read(){
    int num=0,neg=1;char c=getchar();
    while(!isdigit(c)){if(c=='-')neg=-1;c=getchar();}
    while(isdigit(c)){num=(num<<3)+(num<<1)+c-'0';c=getchar();}
    return num*neg;
}
typedef pair<int,int> PII;
const int maxn=100010,mod=998244353;
int n,m,s,t;
struct Edge{
	int nxt,to,val,cost;
}edge[100010];
int head[50010],cnt=1;
void add_edge(int x,int y,int val,int cost){
	edge[++cnt].nxt=head[x];edge[cnt].to=y;edge[cnt].val=val;edge[cnt].cost=cost;head[x]=cnt;
}
int dis[50010],cur[50010],maxflow,vis[50010];
long long cost;
bool Spfa(){
	for(int i=s;i<=t;i++)dis[i]=llinf/2,cur[i]=head[i],vis[i]=0;
	dis[s]=0;queue<int>que;que.push(s);
	while(!que.empty()){
		int u=que.front();que.pop();vis[u]=0;
		for(int i=head[u];i;i=edge[i].nxt){
			int v=edge[i].to;
			if(dis[v]>dis[u]+edge[i].cost&&edge[i].val){
				dis[v]=dis[u]+edge[i].cost;
				if(!vis[v])que.push(v),vis[v]=1;
			}
		}
	}return dis[t]!=llinf/2;
}
int dfs(int x,int flow){
	int rlow=0;if(x==t){maxflow+=flow;return flow;}
	int used=0;vis[x]=1;
	for(int i=cur[x];i;i=edge[i].nxt){
		int v=edge[i].to;cur[x]=i;
		if((!vis[v]||v==t)&&edge[i].val&&dis[v]==dis[x]+edge[i].cost){
			if(rlow=dfs(v,min(flow-used,edge[i].val))){
				cost+=edge[i].cost*rlow;edge[i].val-=rlow;edge[i^1].val+=rlow;
				used+=rlow;if(used==flow)break;
			}
		}
	}return used;
}
void work(){
	while(Spfa()){
		vis[t]=1;
		while(vis[t]){
			for(int i=s;i<=t;i++)vis[t]=0;dfs(s,inf);
		}
	}
}
int lim[maxn],col[maxn],val[maxn],a[maxn];
void add(int x,int y,int z,int w){
    add_edge(x,y,z,w);
    add_edge(y,x,0,-w);
}
void clear(){
    cnt=1;
    for(int i=1;i<=m;i++)
        a[i]=0;
    for(int i=s;i<=t;i++)
        head[i]=0;
    cost=maxflow=0;
}
signed main(){
    int T;
    scanf("%lld",&T);
    while(T--){
        clear();
        scanf("%lld%lld",&n,&m);
        for(int i=1;i<=m;i++)
            scanf("%lld",&lim[i]);
        for(int i=1;i<=2*n;i++){
            scanf("%lld",&col[i]);
            a[col[i]]++;
        }
        bool flg=0;
        for(int i=1;i<=m;i++)
            if(lim[i]>a[i])
                flg=1;
        if(flg)
            printf("-1\n");
        else{
            long long sum=0;
            for(int i=1;i<=2*n;i++){
                scanf("%lld",&val[i]);
                sum+=val[i];
            }
            s=0;t=2*n+m+1;
            for(int i=1;i<=m;i++)
                add(s,i,a[i]-lim[i],0);
            for(int i=1;i<=2*n;i++)
                add(col[i],m+i,1,val[i]);
            for(int i=1;i<2*n;i++)
                add(m+i,m+i+1,i/2,0);
            add(2*n+m,t,n,0);
            work();
            if(maxflow!=n)
                printf("-1\n");
            else
                    printf("%lld\n",sum-cost);
        }
    }
    return 0;
}
/*
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

*/