#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
const int N = 510;
typedef long long ll;
struct Edge{
    int p, v;
    ll w;
};
struct MCMF{
    int sz, id[N][N];
    bool vis[N];
    vector<Edge> tu[N];
    int S, T;
    int max_flow;
    ll dis[N], min_cost;
    void init(){
        for(int i = 0; i <= sz; i++){
            fill(id[i], id[i]+sz+1, 0), tu[i].clear(), vis[i] = false;
        }
        S = T = 0;
        max_flow = min_cost = 0;
    }
    int new_p(){
        return ++sz;
    }
    void add_edge(int x, int y, int v, int w){
        tu[x].push_back({y, v, w}), id[x][y] = tu[x].size()-1;
        tu[y].push_back({x, 0, -w}), id[y][x] = tu[y].size()-1;
    }
    bool spfa(){
        fill(vis, vis+sz+1, 0);
        fill(dis, dis+sz+1, 1e15);
        dis[S] = 0;
        queue<int> q;
        q.push(S), vis[S] = 1;
        while(!q.empty()){
            int x = q.front(); q.pop();
            vis[x] = false;
            for(auto E: tu[x]){
                if(E.v && dis[E.p] > dis[x] + E.w){
                    dis[E.p] = dis[x] + E.w;
                    if(!vis[E.p]) q.push(E.p), vis[E.p] = true;
                }
            }
        }
        return dis[T] < 1e14;
    }
    ll dfs(int x, int flow){
        if(x == T) return flow;
        int res = flow;
        vis[x] = true;
        for(auto &E: tu[x]){
            if(!E.v) continue;
            if(!vis[E.p] && dis[E.p] == dis[x] + E.w){
                int tf = dfs(E.p, min(res, E.v));
                res -= tf;
                E.v -= tf, tu[E.p][id[E.p][x]].v += tf;
                min_cost += E.w * tf;
                if(!res) break;
            }
        }
        vis[x] = false;
        return flow - res;
    }
    pair<int, ll> dinic(){
        while(spfa()){
            int f = dfs(S, 1e9);
            while(f) max_flow += f, f = dfs(S, 1e9);
        }
        return {max_flow, min_cost};
    }
};
MCMF F;
int n, m;
int col[N], val[N], lim[N];
ll solve(){
    static int ic[N], id[N];
    F.S = F.new_p(), F.T = F.new_p();
    for(int i = 1; i <= m; i++) ic[i] = F.new_p();
    for(int i = 1; i <= 2*n; i++) id[i] = F.new_p();
    for(int i = 1; i <= 2*n; i++) lim[col[i]]--;
    for(int i = 1; i <= m; i++){
        if(lim[i] > 0) return -1;
        F.add_edge(F.S, ic[i], -lim[i], 0);
    }
    ll sum = 0;
    for(int i = 1; i <= 2*n; i++){
        sum += val[i];
        F.add_edge(ic[col[i]], id[i], 1, val[i]);
    }
    for(int i = 1; i < 2*n; i++) F.add_edge(id[i], id[i+1], i/2, 0);
    F.add_edge(id[2*n], F.T, n, 0);
    auto ans = F.dinic();
    if(ans.X != n) return -1;
    return sum - ans.Y; 
}
int main(){
    int t; scanf("%d", &t);
    while(t--){
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= m; i++) scanf("%d", &lim[i]);
        for(int i = 1; i <= 2*n; i++) scanf("%d", &col[i]);
        for(int i = 1; i <= 2*n; i++) scanf("%d", &val[i]);
        printf("%lld\n", solve());
        F.init();
    }
    return 0;
}
/*
1
3 2
1 2
1 2 2 2 1 2
3 1 4 2 2 1
*/