#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int inf=0x3f3f3f3f;
const ll infll=0x3f3f3f3f3f3f3f3f;
//#define int long long
#define pii pair <int,int>
#define ld long double
#define endl "\n"
const int N=2050,M=2050;
int l[N];
int col[N];
int val[N];


const int INF = 0x3f3f3f3f;
int tot = 1, lnk[N], cur[N], ter[M], nxt[M], cap[M], cost[M], dis[N], ret;
bool vis[N];

void adda(int u, int v, int w, int c) {
  ter[++tot] = v, nxt[tot] = lnk[u], lnk[u] = tot, cap[tot] = w, cost[tot] = c;
}

void ADD(int u, int v, int w, int c) { adda(u, v, w, c), adda(v, u, 0, -c); }

bool spfa(int s, int t) {
  memset(dis, 0x3f, sizeof(dis));
  memcpy(cur, lnk, sizeof(lnk));
  std::queue<int> q;
  q.push(s), dis[s] = 0, vis[s] = 1;
  while (!q.empty()) {
    int u = q.front();
    q.pop(), vis[u] = 0;
    for (int i = lnk[u]; i; i = nxt[i]) {
      int v = ter[i];
      if (cap[i] && dis[v] > dis[u] + cost[i]) {
        dis[v] = dis[u] + cost[i];
        if (!vis[v]) q.push(v), vis[v] = 1;
      }
    }
  }
  return dis[t] != INF;
}

int dfs(int u, int t, int flow) {
  if (u == t) return flow;
  vis[u] = 1;
  int ans = 0;
  for (int &i = cur[u]; i && ans < flow; i = nxt[i]) {
    int v = ter[i];
    if (!vis[v] && cap[i] && dis[v] == dis[u] + cost[i]) {
      int x = dfs(v, t, min(cap[i], flow - ans));
      if (x) ret += x * cost[i], cap[i] -= x, cap[i ^ 1] += x, ans += x;
    }
  }
  vis[u] = 0;
  return ans;
}

int mcmf(int s, int t) {
  int ans = 0;
  //cerr<<"touch"<<endl;
  while (spfa(s, t)) {
   // cerr<<ans<<endl;
    int x;
    while ((x = dfs(s, t, INF))) ans += x;
  }
  return ans;
}



signed main (){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t;
    cin >>t;
    while (t--){
        int n,m;
        cin >>n>>m;
        for (int i=0;i<=1949;i++){
            lnk[i]=0;
        }
        tot=1;
        ret=0;
        for (int i=1;i<=m;i++){
            cin >>l[i];
            l[i]=-l[i];
        }
        for (int i=1;i<=2*n;i++){
            cin >>col[i];
            l[col[i]]++;
        }
        int sum=0;
        for (int i=1;i<=2*n;i++){
            cin >>val[i];
            sum+=val[i];
        }
        int flag=1;
        for (int i=1;i<=m;i++){
            if (l[i]<0)flag=0;
        }
        int S_=1050,T_=1051;
        
        ADD(S_,n*2,n,0);
        for (int i=2;i<=n*2;i++){
            ADD(i,i-1,(i-1)/2,0);
        }
        for (int i=1;i<=n*2;i++){
            ADD(i,n*2+col[i],1,val[i]);
        }
        for (int i=1;i<=m;i++){
            ADD(i+n*2,T_,l[i],0);
        }
        if (!flag){
            cout <<-1<<endl;
            continue;
        }else{
          //  cout <<mcmf(S_,T_)<<endl;
            if (mcmf(S_,T_)==n)cout <<sum-ret<<endl;
            else cout <<-1<<endl;

        }
    }

}