#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 505, M = 50005;
const int INF = 1e9;
namespace MCMF {
    int cnt, ls[N], ans, S, T, n, cur[N], dis[N], vis[N], anss;
    struct edge {
        int nx, to;
        int c, val;
    } bian[2 * M];
    void add_edge(int x, int y, int cap, int cost) {
//        cout << x << " " << y << " " << cap << " " << cost << '\n';
        bian[++cnt].nx = ls[x];
        bian[cnt].to = y;
        bian[cnt].c = cap;
        bian[cnt].val = cost;
        ls[x] = cnt;
        bian[++cnt].nx = ls[y];
        bian[cnt].to = x;
        bian[cnt].c = 0;
        bian[cnt].val = -cost;
        ls[y] = cnt;
    }
    void init() {
        cnt = 1, ans = 0;
        memset(ls, 0, sizeof(ls));
    }
    bool SPFA() {
        queue<int> q;
        for (int i = 1; i <= n; i++)
            cur[i] = ls[i], dis[i] = INF, vis[i] = 0;
        q.push(S);
        dis[S] = 0;
        vis[S] = 1;
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            vis[u] = 0;
            for (int i = ls[u]; i; i = bian[i].nx) {
                if (bian[i].c && dis[bian[i].to] > dis[u] + bian[i].val) {
                    dis[bian[i].to] = dis[u] + bian[i].val;
                    if (!vis[bian[i].to]) {
                        q.push(bian[i].to);
                        vis[bian[i].to] = 1;
                    }
                }
            }
        }
        return dis[T] != INF;
    }
    int dfs(int now, int flow) {
        if (now == T)return flow;
        int sum = 0;
        vis[now] = 1;
        for (int &i = cur[now]; i; i = bian[i].nx) {
            if (dis[bian[i].to] == dis[now] + bian[i].val && bian[i].c && !vis[bian[i].to]) {
                int sav = dfs(bian[i].to, min(flow, bian[i].c));
                if (sav) {
                    bian[i].c -= sav;
                    bian[i ^ 1].c += sav;
                    sum += sav;
                    flow -= sav;
                    anss += sav * bian[i].val;
                    if (!flow)return sum;
                } else dis[bian[i].to] = -1;
            }
        }
        return sum;
    }
    int work() {
        while (SPFA()) {
            for (int i = 1; i <= n; i++)vis[i] = 0;
            ans += dfs(S, INF);
        }
        return ans;
    }
}
int n, m, lim[N], col[N], val[N], num[N], T;
signed main() {
    cin >> T;
    while (T--) {
        memset(num, 0, sizeof(num));
        MCMF::init();
        cin >> n >> m;
        for (int i = 1; i <= m; i++) {
            cin >> lim[i];
        }
        MCMF::n = m + 3 * n + 3;
        MCMF::S = 1;
        MCMF::T = m + 3 * n + 3;
        int tt = m + 3 * n + 2, sum(0);
        for (int i = 1; i <= 2 * n; i++) {
            cin >> col[i];
            num[col[i]]++;
        }
        for (int i = 1; i <= 2 * n; i++) {
            cin >> val[i];
            sum += val[i];
        }
        for (int i = 1; i <= m; i++) {
            MCMF::add_edge(MCMF::S, i + 1, num[i] - lim[i], 0);
        }

        for (int i = 1; i <= 2 * n; i++) {
            MCMF::add_edge(col[i] + 1, m + 1 + i, 1, 0);
            if (i > 1) {
                MCMF::add_edge(m + 1 + i, m + 2 * n + 1 + i / 2, 1, val[i]);
            }
        }
        for (int i = 1; i <= n; i++) {
            if (i > 1) {
                MCMF::add_edge(m + 2 * n + 1 + i, m + 2 * n + 1 + i - 1, INF, 0);
            }
            MCMF::add_edge(m + 2 * n + 1 + i, tt, 1, 0);
        }
        MCMF::add_edge(tt, MCMF::T, n, 0);
        if (MCMF::work() == n)
            cout << sum - MCMF::anss << '\n';
        else cout << -1 << '\n';
    }
    return 0;
}