#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <numeric>
#include <queue>
#include <cassert>
#include <cstring>
#include <climits>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <array>

using namespace std;
#define int long long

constexpr int N = 1e3, M = 1e3, INF = LLONG_MAX;

int idx, f[M], w[M], e[M], ne[M], h[N];
void add(int a, int b, int c, int d) {
    f[idx] = c, w[idx] = d, e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
    f[idx] = 0, w[idx] = - d, e[idx] = a, ne[idx] = h[b], h[b] = idx ++;
}

int n, m, S, T;
int pre[N], inf[N], d[N];
int spfa() {
    for (int i = 0; i < N; i += 1) d[i] = INF, inf[i] = pre[i] = 0;
    inf[S] = INF; d[S] = 0;

    queue<int> q; vector inq(N, 0LL);
    q.push(S); inq[S] = 1;
    while (q.size()) {
        int u = q.front();
        q.pop();
        inq[u] = 0;

        // cout << u << ' ' << h[u] << '\n';

        for (int i = h[u]; i != - 1; i = ne[i]) {
            int v = e[i];
            // cout << v << '\n';
            if (f[i] && d[v] > d[u] + w[i]) {
                d[v] = d[u] + w[i]; inf[v] = min(f[i], inf[u]); pre[v] = i;
                if (inq[v] == 0) {
                    q.push(v); inq[v] = 1;
                }
            }
        }
    }
    return inf[T] > 0;
}

void EK(int &flow, int &cost) {
    while (spfa()) {
        int t = inf[T];
        // cout << t << ' ' << d[T] << '\n';
        flow += t, cost += t * d[T];
        for (int u = T; u != S; u = e[pre[u] ^ 1]) {
            f[pre[u]] -= t;
            f[pre[u] ^ 1] += t;
        }
    }
}

void solve() {
    memset(h, - 1, sizeof h);

    int n, m;
    cin >> n >> m;

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

    vector c(2 * n + 10, 0LL);
    map<int, int> mp;
    for (int i = 1; i <= 2 * n; i += 1) {
        cin >> c[i];
        mp[c[i]] += 1;
    }

    vector v(2 * n + 10, 0LL);
    int ans = 0;
    for (int i = 1; i <= 2 * n; i += 1) {
        cin >> v[i];
        ans += v[i];
    }

    S = 2 * n + m + 1;
    T = 2 * n + m + 2;

    for (int i = 1; i + 1 <= 2 * n; i += 1) {
        add(i + 1, i, i / 2, 0);
    }
    add(S, 2 * n, n, 0);

    for (int i = 1; i <= 2 * n; i += 1) {
        add(i, 2 * n + c[i], 1, v[i]);
    }
    
    for (int i = 1; i <= m; i += 1) {
        if (mp[i] < l[i]) {
            cout << - 1 << '\n';
            return;
        }
        add(2 * n + i, T, mp[i] - l[i], 0);
    }

    int flow = 0, cost = 0;
    EK(flow, cost);
    if (flow == n) {
        cout << ans - cost << '\n';
    } else {
        cout << - 1 << '\n';
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    cin >> t;

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

    return 0;
}