#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

template <class T> struct MCFGraph {
    static constexpr T inf = numeric_limits<T>::max() / 2;
    struct Edge {
        int v;
        T c, w;
        Edge(int v, T c, T w) : v{v}, c{c}, w{w} {}
    };
    int n;
    vector<Edge> e;
    vector<vector<int>> g;
    vector<T> dis;
    vector<int> vis, pre;
    MCFGraph() {}
    MCFGraph(int n) { init(n); }
    void init(int n) {
        this->n = n;
        e.clear();
        g.assign(n, {});
        dis.resize(n);
        vis.resize(n);
        pre.resize(n);
    }
    void addEdge(int u, int v, T c, T w) {
        g[u].push_back(e.size());
        e.emplace_back(v, c, w);
        g[v].push_back(e.size());
        e.emplace_back(u, 0, -w);
    }
    bool spfa(int s, int t) {
        dis.assign(n, inf);
        vis.assign(n, 0);
        pre.assign(n, -1);
        queue<int> que;
        dis[s] = 0;
        vis[s] = 1;
        que.push(s);
        while (!que.empty()) {
            int x = que.front();
            que.pop();
            vis[x] = 0;
            for (int i : g[x]) {
                auto [y, c, w] = e[i];
                if (c > 0 && dis[y] > dis[x] + w) {
                    dis[y] = dis[x] + w;
                    pre[y] = i;
                    if (!vis[y]) {
                        vis[y] = 1;
                        que.push(y);
                    }
                }
            }
        }
        return pre[t] != -1;
    }
    pair<T, T> flow(int s, int t) {
        T flow{}, cost{};
        while (spfa(s, t)) {
            T aug = inf;
            for (int i = t; i != s; i = e[pre[i] ^ 1].v) {
                aug = min(aug, e[pre[i]].c);
            }
            for (int i = t; i != s; i = e[pre[i] ^ 1].v) {
                e[pre[i]].c -= aug;
                e[pre[i] ^ 1].c += aug;
            }
            flow += aug;
            cost += aug * dis[t];
        }
        return {flow, cost};
    }
};

void solve() {
    int n, m;
    cin >> n >> m;

    vector<int> l(m);
    for (int i = 0; i < m; i++) {
        cin >> l[i];
    }

    vector<int> c(2 * n), v(2 * n);
    for (int i = 0; i < 2 * n; i++) {
        cin >> c[i];
        c[i]--;
    }
    for (int i = 0; i < 2 * n; i++) {
        cin >> v[i];
    }

    vector<int> cnt(m);
    for (int i = 0; i < 2 * n; i++) {
        cnt[c[i]]++;
    }

    const int S = 3 * n + m, T = S + 1;
    MCFGraph<i64> mcf(T + 1);
    for (int i = 0; i < m; i++) {
        if (cnt[i] < l[i]) {
            cout << "-1\n";
            return;
        }
        mcf.addEdge(S, i, cnt[i] - l[i], 0);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 2 * i + 1; j <= n + i; j++) {
            mcf.addEdge(c[j], m + j, 1, v[j]);
            mcf.addEdge(m + j, m + 2 * n + i, 1, 0);
        }
        mcf.addEdge(m + 2 * n + i, T, 1, 0);
    }

    auto [x, y] = mcf.flow(S, T);
    if (x != n) {
        cout << "-1\n";
    } else {
        cout << accumulate(v.begin(), v.end(), 0LL) - y << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(16);

    int t = 1;
    cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}