#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
const ll INF = 1e18;

struct MCMF
{
    struct edge {
        int v;
        ll w, c;
    };
    vector<edge> e;
    vector<vector<int>> g;
    vector<ll> dis, flw;
    vector<int> pre, lst;
    int n;

    MCMF(int n) {
        g.resize(n);
        this->n = n;
    }
    void addEdge(int u, int v, int w, int c)
    {
        g[u].push_back(e.size());
        e.push_back({v, w, c});
        g[v].push_back(e.size());
        e.push_back({u, 0, -c});
    }

    bool spfa(int s, int t)
    {
        dis.assign(n, INF);
        flw.assign(n, 0);
        pre.assign(n, -1);
        lst.assign(n, -1);

        queue<int> q;
        vector<int> vis(n);
        q.push(s);
        dis[s] = 0, flw[s] = INF;
        while (!q.empty())
        {
            int u = q.front(); q.pop();
            vis[u] = 0;
            for (int i : g[u])
            {
                auto [v, w, c] = e[i];
                if (w > 0 and dis[v] > dis[u] + c)
                {
                    dis[v] = dis[u] + c;
                    flw[v] = min(flw[u], w);
                    pre[v] = u;
                    lst[v] = i;
                    if (!vis[v])
                    {
                        vis[v] = 1;
                        q.push(v);
                    }
                }
            }
        }
        return dis[t] != INF;
    }

    ll maxflow, mincost;
    void flow(int s, int t)
    {
        maxflow = mincost = 0;
        while (spfa(s, t))
        {
            maxflow += flw[t];
            mincost += dis[t] * flw[t];
            for (int u = t; u != s; u = pre[u])
            {
                int i = lst[u];
                e[i].w -= flw[t];
                e[i ^ 1].w += flw[t];
            }
        }
    }
};

int solve(int n, int m)
{
    vector<int> l(m + 1), c(n * 2 + 1), v(n * 2 + 1);
    ll sum = 0;
    for (int i = 1; i <= m; i++)
        cin >> l[i], l[i] *= -1;
    for (int i = 1; i <= n * 2; i++)
        cin >> c[i], l[ c[i] ]++;
    for (int i = 1; i <= n * 2; i++)
        cin >> v[i], sum += v[i];
    
    int s = n * 2 + m + 1, t = s + 1;
    MCMF cf(t + 1);
    cf.addEdge(s, n * 2, n, 0);
    for (int i = 1; i < n * 2; i++)
        cf.addEdge(i + 1, i, i / 2, 0);
    for (int i = 1; i <= n * 2; i++)
        cf.addEdge(i, n * 2 + c[i], 1, v[i]);
    for (int i = 1; i <= m; i++)
    {
        if (l[i] < 0) return -1;
        cf.addEdge(n * 2 + i, t, l[i], 0);
    }
    cf.flow(s, t);

    if (cf.maxflow != n) return -1;
    return sum - cf.mincost;
}

int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);

    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        cout << solve(n, m) << '\n';
    }
    return 0;
}