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

typedef long long ll;

const ll INF = 1e14;
           
template <class T, class C>
struct MCMF{
    int n, m, s, t;
    struct Edge{
        int from, to;
        T cap, flow; 
        C cost;
    };
    vector<vector<int>> node;
    vector<Edge> edges;
    vector<int> inq;
    vector<int> p;
    vector<C> d;
    vector<T> a;
    MCMF(){}
    MCMF(int n) : node(n), p(n), inq(n), d(n), a(n){
        this -> n = n;
    }
    void add_edge(int from, int to, T cap, C cst){
        edges.push_back(Edge{from, to, cap, 0, cst});
        edges.push_back(Edge{to, from, 0, 0, -cst});
        m = edges.size();
        node[from].push_back(m - 2);
        node[to].push_back(m - 1);
    }
    bool BFS(T &flow, C &cost){
        for(int i = 0; i < n; i++){
            d[i] = INF;
        }
        inq.assign(n, 0);
        d[s] = 0; inq[s] = 1; p[s] = 0; a[s] = INF;

        queue<int> qe;
        qe.push(s);
        while(!qe.empty()){
            int u = qe.front(); qe.pop();
            inq[u] = 0;
            for(int i = 0; i < node[u].size(); i++){
                Edge &e = edges[node[u][i]];
                if(e.cap > e.flow && d[e.to] > d[u] + e.cost){
                    d[e.to] = d[u] + e.cost;
                    p[e.to] = node[u][i];
                    a[e.to] = min(a[u], e.cap - e.flow);
                    if(!inq[e.to]){
                        qe.push(e.to); inq[e.to] = 1;
                    }
                }
            }
        }
        if(d[t] == INF)return false;
        flow += a[t];
        cost += d[t] * a[t];
        int u = t;
        while(u != s){
            edges[p[u]].flow += a[t];
            edges[p[u] ^ 1].flow -= a[t];
            u = edges[p[u]].from;
        }
        return true;
    }
    pair<T, C> work(int s, int t){
        this -> s = s, this -> t = t;
        T flow = 0; 
        C cost = 0;
        while(BFS(flow, cost));
        return {flow, cost};
    }
};

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

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

    vector<int> col(n);
    for(int i = 0; i < n; i++){
        cin >> col[i];
        col[i]--;
        cnt[col[i]]++;
    }

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

    ll sum = accumulate(val.begin(), val.end(), 0ll);

    MCMF<ll, ll> gp(n + m + 2);
    int S = n + m, T = n + m + 1;
    for(int i = 0; i < n; i++){
        if(i)gp.add_edge(i - 1, i, (i / 2), 0);
        gp.add_edge(n + col[i], i, 1, val[i]);
    }
    gp.add_edge(n - 1, T, INF, 0);

    for(int i = 0; i < m; i++){
        if(num[i] > cnt[i]){
            cout << -1 << "\n";
            return;
        }
        gp.add_edge(S, n + i, cnt[i] - num[i], 0);
    }

    auto [flow, cost] = gp.work(S, T);
    if(flow != n / 2){
        cout << -1 << "\n";
    } else{
        cout << sum - cost << "\n";
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while(t--)solve();
    return 0;
}

/*
1
8 6
0 2 2 0 3 1
3 5 1 1 5 3 5 2 3 2 2 1 2 2 4 6
998133227 879226371 59632864 356493387 62611196 827258251 296576565 204244054 812713672 780267148 614679390 447700005 102067050 544546349 116002772 761999375
*/