#include<bits/stdc++.h>
//#define endl '\n'
#define endl std::endl
#define i64 long long
#define pb push_back
#define pii std::pair<i64, i64>
#define pos1(x) x
#define pos2(x) (2 * n + x)
#define INF 0x3f3f3f3f3f3f3f3f
const i64 P = 1e13;
const i64 N = 500;
i64 T, n, m, s, t, sum;
i64 cnt;
i64 maxflow, mincost;
i64 head[N];
i64 dis[N], flow[N], pre[N];
i64 l[N], c[N], v[N];
bool vis[N];
struct Edge {
	i64 next, ver, w, c;
} edge[N];
inline void add(i64 u, i64 v, i64 w, i64 c) {
	edge[++cnt].next = head[u], edge[cnt].ver = v, edge[cnt].w = w, edge[cnt].c = c;
	head[u] = cnt;
}
inline bool SPFA(i64 s, i64 t) {
	memset(dis, INF, sizeof(dis));
	memset(vis, false, sizeof(vis));
	dis[s] = 0, vis[s] = true;
	flow[s] = INF;
	std::queue<int> q;
	q.push(s);
	while (!q.empty()) {
		i64 u = q.front();
		q.pop();
		vis[u] = false;
		for (i64 i = head[u]; i; i = edge[i].next) {
			i64 v = edge[i].ver, w = edge[i].w, c = edge[i].c;
			if (w && dis[u] + c < dis[v]) {
				dis[v] = dis[u] + c;
				flow[v] = std::min(flow[u], w);
				pre[v] = i;
				if (!vis[v]) {
					vis[v] = true;
					q.push(v);
				}
			}
		}
	}
	return dis[t] != INF;
}
inline void update(i64 s, i64 t) {
	i64 x = t;
	while (x != s) {
		i64 i = pre[x];
		edge[i].w -= flow[t];
		edge[i ^ 1].w += flow[t];
		x = edge[i ^ 1].ver;
	}
	maxflow += flow[t];
	mincost += flow[t] * dis[t];
}
void calc(i64 s, i64 t) {
	maxflow = mincost = 0;
	while (SPFA(s, t))
		update(s, t);
} 
int main() {
	//std::ios::sync_with_stdio(false);
	//std::cin.tie(0), std::cout.tie(0);
	std::cin >> T;
	while (T--) {
		for (int i = 1; i <= cnt; i++)
			edge[i].next = edge[i].ver = edge[i].w = edge[i].c = 0;
		std::cin >> n >> m;
		for (int i = 1; i <= 2 * n + m + 2; i++)
			head[i] = 0;
		cnt = 1;
		s = 2 * n + m + 1, t = 2 * n + m + 2;
		sum = 0;
		for (i64 i = 1; i <= m; i++)
			std::cin >> l[i], sum += l[i];
		for (i64 i = 1; i <= 2 * n; i++)
			std::cin >> c[i];
		for (i64 i = 1; i <= 2 * n; i++)
			std::cin >> v[i];
		for (i64 i = 1; i <= 2 * n; i += 2)
			add(s, pos1(i), 1, 0), add(pos1(i), s, 0, 0);
		for (i64 i = 1; i < 2 * n; i++)
			add(pos1(i + 1), pos1(i), 2 * n + m, 0), add(pos1(i), pos1(i + 1), 0, 0);
		for (i64 i = 1; i <= 2 * n; i++)
			add(pos1(i), pos2(c[i]), 1, -v[i]), add(pos2(c[i]), pos1(i), 0, v[i]);
		for (i64 i = 1; i <= m; i++) {
			add(pos2(i), t, l[i], -P), add(t, pos2(i), 0, P);
			add(pos2(i), t, 2 * n + m, 0), add(t, pos2(i), 0, 0);
		}
		calc(s, t);
		if (mincost / -P == sum)
			std::cout << -mincost % -P << endl;
		else
			std::cout << -1 << endl;
	}
	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

*/