#include <bits/stdc++.h>
#define int long long
using namespace std;

namespace MCFC
{
    struct edge
    {
        int to, nxt;
        int w, c;
    };
    edge e[10010];
    int head[110], etot;
    void init()
    {
        memset(head, -1, sizeof head);
        etot = 0;
    }
    void addEdge(int u, int v, int w, int c)
    {
        e[etot] = {v, head[u], w, c};
        head[u] = etot++;
        e[etot] = {u, head[v], 0, -c};
        head[v] = etot++;
    }
    int dist[110], incf[110], pre[110], vis[110];
    bool spfa(int s, int t)
    {
        memset(dist, 0x3f, sizeof dist);
        queue<int> q;
        q.push(s), dist[s] = 0, incf[s] = 0x3f3f3f3f3f3f3f3f, incf[t] = 0;
        while (q.size())
        {
            int u = q.front();
            q.pop();
            vis[u] = false;
            for (int i = head[u]; ~i; i = e[i].nxt)
            {
                if (!e[i].w || dist[e[i].to] <= dist[u] + e[i].c)
                    continue;
                dist[e[i].to] = dist[u] + e[i].c;
                incf[e[i].to] = min(incf[u], e[i].w);
                pre[e[i].to] = i;
                if (!vis[e[i].to])
                    vis[e[i].to] = true, q.push(e[i].to);
            }
        }
        return incf[t] > 0;
    }
    int maxflow, mincost;
    void update(int s, int t)
    {
        maxflow += incf[t];
        mincost += incf[t] * dist[t];
        for (int u = t; u != s; u = e[pre[u] ^ 1].to)
        {
            e[pre[u]].w -= incf[t];
            e[pre[u] ^ 1].w += incf[t];
        }
    }
    void flow(int s, int t)
    {
        maxflow = mincost = 0;
        while (spfa(s, t))
            update(s, t);
    }
}

using namespace MCFC;

int n, m, l[110], col[210], v[210];

void solve()
{
    init();
    int sum = 0;
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
        cin >> l[i];
    for (int i = 1; i <= 2 * n; i++)
    {
        cin >> col[i];
        l[col[i]]--;
    }
    for (int i = 1; i <= 2 * n; i++)
        cin >> v[i], sum += v[i];
    int s = n * 2 + m + 1, t = s + 1;
    addEdge(s, 2 * n, n, 0);
    for (int i = 1; i < 2 * n; i++)
    {
        addEdge(i + 1, i, i >> 1, 0);
    }
    for (int i = 1; i <= 2 * n; i++)
    {
        addEdge(i, n * 2 + col[i], 1, v[i]);
    }
    int flag = 1;
    for (int i = 1; i <= m; i++)
    {
        if (l[i] > 0)
        {
            flag = 0;
            break;
        }
        addEdge(n * 2 + i, t, -l[i], 0);
    }
    if (!flag)
    {
        cout << "-1\n";
        return;
    }
    flow(s, t);
    if (MCFC::maxflow != n)
        cout << "-1\n";
    else
        cout << sum - MCFC::mincost << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}