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

#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,const T&y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,const T&y){if(y<x)x=y;}

#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define mem(x) memset((x),0,sizeof(x))

typedef double db;
typedef long long ll;
typedef vector<int>vi;
typedef pair<int,int>pii;

typedef unsigned u32;
typedef unsigned uint;
typedef unsigned long long u64;

namespace EK{
  static const int inf=INT_MAX;
  static const int maxN=510;
  static const int maxM=1e5+10;
  int ecnt,h[maxN];
  struct edges{
    int nxt,to,w,c;
  }E[maxM];
  void addline(int u,int v,int w,int c){
    E[++ecnt]={h[u],v,w,c},h[u]=ecnt;
    E[++ecnt]={h[v],u,0,-c},h[v]=ecnt;
  }
  bool inq[maxN];
  int S,T,fl[maxN],dis[maxN],pre[maxN];
  void gnxt(int&x){if(++x==maxN)x=0;}
  bool spfa(){
    static int Q[maxN];
    memset(dis,0x3f,sizeof dis);
    int l=0,r=1;Q[0]=S,dis[S]=0,fl[S]=inf;
    while(l!=r){
      int u=Q[l];gnxt(l),inq[u]=0;
      for(int i=h[u];i;i=E[i].nxt){
        int v=E[i].to;
        if(E[i].w&&dis[v]>dis[u]+E[i].c){
          pre[v]=i,fl[v]=min(fl[u],E[i].w),dis[v]=dis[u]+E[i].c;
          if(!inq[v]){
            Q[r]=v,inq[v]=1;if(l!=r&&dis[Q[l]]>dis[Q[r]])swap(Q[l],Q[r]);gnxt(r);
          }
        }
      }
    }
    return dis[T]<1e9;
  }
  pair<int,int>EK(){
    int w=0;int c=0;
    while(spfa()){
      w+=fl[T],c+=fl[T]*dis[T];
      for(int u=T;u!=S;u=E[pre[u]^1].to){
        E[pre[u]].w-=fl[T],E[pre[u]^1].w+=fl[T];
      }
    }
    return{w,c};
  }
}

int n;
int l[105],c[205],v[205];

void solve(){
  int m;
  cin>>n>>m;
  rep(i,1,m)cin>>l[i];
  rep(i,1,n+n)cin>>c[i];
  rep(i,1,n+n)cin>>v[i];
  
  int s=m+2*n+2*n+1,t=s+1;
  int ss=t+1,tt=ss+1;
  int sum_low=0;ll dt=0;
  
  EK::ecnt=1;
  memset(EK::h,0,sizeof EK::h);
  EK::S=ss,EK::T=tt;
  
  auto add=[&](int u,int v,int w_l,int w_r,ll c){
    EK::addline(u,v,w_r-w_l,c);
    sum_low+=w_l;
    dt+=w_l*c;
    if(w_l){
      EK::addline(ss,v,w_l,0);
      EK::addline(u,tt,w_l,0);
    }
  };
  
  rep(i,1,m)add(s,i,l[i],n,0); 
  rep(i,1,2*n)add(c[i],m+i,0,1,-v[i]);
  rep(i,1,2*n){
    add(m+i,m+2*n+i,0,1,0);
    if(i>1)add(m+2*n+i-1,m+2*n+i,i/2,n,0);
  }
  add(m+2*n+2*n,t,n,n,0);
  
  EK::addline(t,s,(int)1e9,0);
  
  auto pr=EK::EK();
//  printf("(%d %d) %lld\n",pr.first,sum_low,pr.second);
  
  if(pr.first==sum_low){
    cout<<-dt-pr.second<<endl;
  }else{
    cout<<-1<<endl;
  }
}

signed main(){
//  freopen(".in","r",stdin);
//  freopen(".out","w",stdout);
  int T;cin>>T;while(T--)solve();
//  solve();
  return 0;
}