#include <bits/stdc++.h>

using namespace std;

#define rep(i, l, r) for (int i = l; i <= r; ++i)

const long long inf = INT_MAX;

struct Edge {
    int v, nxt, f, w;
};

const int N = 1e3;
const int M = 1e6;
int n, m, s, t, s2;
int cur[N];
long long dis[N];
bool vis[N];
Edge E[M << 1];
int head[N];
int sz = 1;
int cnt;
long long sum;
int cn[N];

int l[N], c[N], v[N];

void add_edge(int u, int v, int f, int w) {
    E[++sz] = {v, head[u], f, w};
    head[u] = sz;
}

void add_flow(int u, int v, int f, int w) {
    add_edge(u, v, f, w), add_edge(v, u, 0, -w);
}

bool spfa() {
    deque<int> q;
    rep(i, 1, cnt) dis[i] = inf, cur[i] = head[i], vis[i] = false;
    q.push_front(t), dis[t] = 0, vis[t] = 1;
    while (!q.empty()) {
        int u = q.front();
        q.pop_front();
        vis[u] = 0;
        for (int i = head[u]; i; i = E[i].nxt) {
            auto& [v, nxt, f, w] = E[i];
            if (E[i ^ 1].f > 0 && dis[v] > dis[u] + E[i ^ 1].w) {
                dis[v] = dis[u] + E[i ^ 1].w;
                if (vis[v]) continue;
                if (!q.empty() && dis[v] < dis[q.front()]) q.push_front(v);
                else q.push_back(v);
                vis[v] = 1;
            }
        }
    }
    return dis[s] != inf;
}

long long cost;

long long dfs(int u, long long flow) {
    if (u == t || !flow) return flow;
    vis[u] = 1;
    long long rest = flow;
    for (int& i = cur[u]; i; i = E[i].nxt) {
        auto& [v, nxt, f, w] = E[i];
        if (vis[v] || dis[u] != dis[v] + w || f <= 0) continue;
        long long x = dfs(v, min(rest, (long long)f));
        if (x) E[i].f -= x, E[i ^ 1].f += x, rest -= x, cost += w * x;
        if (!rest) break;
    }
    vis[u] = 0;
    return flow - rest;
}

long long MinCostFlow() {
    long long res = 0, flow;
    while (spfa()) {
        while ((flow = dfs(s, inf))) res += flow;
    }
    return res;
}

void init() {
    sum = 0;
    sz = 1;
    cost = 0;
    memset(head, 0, sizeof(int) * (cnt + 1));
    memset(cn, 0, sizeof(int) * (m + 1));
}

void work() {
    scanf("%d%d", &n, &m);
    s = n * 2 + m + 1, t = n * 2 + m + 2;
    cnt = n * 2 + m + 2;
    init();
    rep(i, 1, m) scanf("%d", &l[i]);
    rep(i, 1, 2 * n) scanf("%d", &c[i]), cn[c[i]]++;
    rep(i, 1, 2 * n) scanf("%d", &v[i]), sum += v[i];

    add_flow(s, 2 * n, n, 0);
    rep(i, 1, 2 * n - 1) add_flow(i + 1, i, i / 2, 0);
    rep(i, 1, 2 * n) add_flow(i, 2 * n + c[i], 1, v[i]);
    rep(i, 1, m) add_flow(2 * n + i, t, cn[i] - l[i], 0);

    long long maxflow = MinCostFlow();
    if (maxflow < n) {
        printf("-1\n");
        return;
    }
    printf("%lld\n", sum - cost);
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) work();
    // work();
    return 0;
}