#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define QWQ cout<<"QwQ"<<endl;
#define ll long long
#include <vector>
#include <queue>
#include <stack>
#include <map>
using namespace std;
const ll N=101010;
const ll qwq=303030;
const ll inf=0x3f3f3f3f3f3f3f3f;

inline ll read() {
	ll sum = 0, f = 1; char c = getchar();
	while(c<'0' || c>'9') { if(c=='-') f = -1; c = getchar(); }
	while(c>='0'&&c<='9') { sum = sum * 10 + c - '0'; c = getchar(); }
	return sum * f;
}

ll T;
ll n,m,s,t,cnt=1,maxflow,mincost;
ll L[N],R[N];
ll cl[N],val[N];
struct E{ ll to,nxt,cap,we; } e[N];
ll head[N],dep[N],vis[N],cur[N];
queue <ll> q;

inline void add(ll u,ll v,ll w,ll z) {
	e[++cnt] = (E){ v,head[u],w,z };  head[u] = cnt;
	e[++cnt] = (E){ u,head[v],0,-z }; head[v] = cnt;
}

bool SPFA() {
	for(ll i=0;i<=t;i++) cur[i] = head[i], vis[i] = 0, dep[i] = inf;
	dep[s] = 0; q.push(s);
	while(!q.empty()) {
		ll u = q.front(); q.pop(); vis[u] = 0;
		for(ll i=head[u]; i; i=e[i].nxt) {
			ll v = e[i].to, w = e[i].we;
			if(e[i].cap && dep[v] > dep[u]+w) {
				dep[v] = dep[u]+w;
				if(vis[v]) continue;
				q.push(v); vis[v] = 1;
			}
		}
	}
	return dep[t] != inf;
}

ll DFS(ll u,ll flow) {
	ll res = 0, f;
	if(u==t || !flow) return flow;
	vis[u] = 1;
	for(ll i=cur[u]; i; i=e[i].nxt) {
		cur[u] = i;
		ll v = e[i].to, w = e[i].we;
		if(vis[v]) continue;
		if(e[i].cap && dep[v]==dep[u]+w) {
			f = DFS( v, min(e[i].cap,flow-res) );
			if(f) {
				res += f;
				e[i].cap -= f;
				e[i^1].cap += f;
				mincost += f * w;
				if(res==flow) break;
			}
		}
	}
	return res;
}

void chushihua() {
	cnt = 1;
	mincost = maxflow = 0;
	for(ll i=s;i<=t;i++) head[i] = cur[i] = dep[i] = vis[i] = 0;
	for(ll i=1;i<=m;i++) L[i] = R[i] = 0;
}

int main() {
	T = read();
	while(T--) {
		chushihua();
		n = read()*2; m = read(); s = 0; t = n+m+1;
		ll sum = 0;
		for(ll i=1;i<=m;i++) L[i] = read();
		for(ll i=1;i<=n;i++) cl[i] = read(), R[cl[i]]++;
		for(ll i=1;i<=n;i++) val[i] = read(), sum += val[i];

		for(ll i=1;i<=m;i++) add(s,i,R[i]-L[i],0);
		for(ll i=1;i<=n;i++) {
			add(cl[i],i+m,1,val[i]);
			add(i+m,i+m+1,i/2,0);
		}
		while(SPFA()) maxflow += DFS(s,inf);
		if(maxflow!=n/2) cout<<"-1\n";
		else             cout<<sum-mincost<<"\n";
	}

	return 0;
}

/*



*/