#include<bits/stdc++.h>
using namespace std;
const int N = 2555;
const int INF = 0x3f3f3f3f;
struct Edge{
        int to, cap, wt, next;
}edge[N * 100];
int tot = 1, head[N];
int s, t, cnt = 1, num;
void add(int u, int v, int w, int x){
    edge[++tot] = {v, w, x, head[u]};
    head[u] = tot;
    edge[++tot] = {u, 0, -x, head[v]};
    head[v] = tot;
}
int dis[N], vis[N], maxflow = 0;
void SPFA(){
    queue<int> que;
    memset(dis, 0x3f, sizeof dis[0] * (num + 1));
    que.push(s);
    vis[s] = 1, dis[s] = 0;
    while(!que.empty()){
        int u = que.front();
        que.pop();
        vis[u] = 0;
        for(int i = head[u]; i; i = edge[i].next){
            int v = edge[i].to;
            if(edge[i].cap && dis[v] > dis[u] + edge[i].wt){
                dis[v] = dis[u] + edge[i].wt;
                if(!vis[v]) que.push(v), vis[v] = 1;
            }
        }
    }
}
int dis_dij[N], cur[N];
struct node{
    int dis, u;
    friend bool operator < (node a, node b){
        return a.dis > b.dis;
    }
};
bool dij(){
    priority_queue<node> que; // greater number should change
    memset(dis_dij, 0x3f, sizeof dis_dij[0] * (num + 1));
    dis_dij[s] = 0;
    que.push({0, s});
    while(!que.empty()){
        int u = que.top().u;
        que.pop();
        if(vis[u] == cnt) continue;
        vis[u] = cnt; cur[u] = head[u];
        for(int i = head[u]; i; i = edge[i].next){
            int v = edge[i].to;
            if(edge[i].cap && dis_dij[v] > dis_dij[u] + edge[i].wt + dis[u] - dis[v]){
                    dis_dij[v] = dis_dij[u] + edge[i].wt + dis[u] - dis[v];
                    if(vis[v] != cnt) que.push({dis_dij[v], v});
            }
        }
    }
    return dis_dij[t] < INF;
}
int dfs(int u, int flow){
    if(u == t) return flow;
    int ret = 0, x;
    vis[u] = cnt;
    for(int i = cur[u]; i; i = cur[u]){
        cur[u] = edge[i].next;
        int v = edge[i].to;
        if(edge[i].cap == 0 || vis[v] == cnt || dis_dij[v] != dis_dij[u] + edge[i].wt + dis[u] - dis[v]) continue;
        x = dfs(v, min(flow, edge[i].cap));
        if(x){
            flow -= x; ret += x;
            edge[i].cap -= x, edge[i ^ 1].cap += x;
            maxflow += x * edge[i].wt;
            if(flow == 0) break;
        }
    }
    vis[u] = 0;
    return ret;
}
int dinic(){
    int flow = 0;
    SPFA();
    while(dij()){
        ++cnt, flow += dfs(s, INF);
        for(int i = 1; i <= num; ++ i) dis[i] += dis_dij[i];
    }
    return flow;
}
void clear(){
    memset(head, 0, sizeof head);
    tot = 1; cnt = 1; maxflow = 0;
    memset(vis, 0, sizeof vis);
}
void solve(){
	clear();
	int n, m, sum = 0, num1 = 0;
	cin >> n >> m;
	vector<int> l(m + 1), col(2 * n + 1), val(2 * n + 1);
	for(int i = 1; i <= m; ++ i) cin >> l[i], sum += l[i];
	for(int i = 1; i <= 2 * n; ++ i) cin >> col[i];
	for(int i = 1; i <= 2 * n; ++ i) cin >> val[i];
	int tot = m + 2 * n;
	s = tot + 3, t = tot + 4; num = tot + 4;
	for(int i = 1; i <= m; ++ i){
		add(tot + 1, i, INF, 0);
		add(s, i, l[i], 0);
	}
	for(int i = 1; i <= 2 * n; ++ i){
		add(col[i], m + i, 1, -val[i]);
		if(i & 1) num1++, add(m + i, t, 1, 0);
		add(m + i, m + i + 1, n - num1, 0);
	}
	sum = n - sum;
	if(sum < 0) {
		cout << -1 << endl;
		return;
	}
	add(s, tot + 1, sum, 0);
	int flow;
	flow = dinic();
	// cout << flow << endl;
	if(flow != n){
		cout << -1 << endl;
		return;
	}
	cout << -maxflow << endl;
}
int main(){
	ios::sync_with_stdio(0);
	int T; cin >> T;
	while(T--){
		solve();
	}
}