#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define rop(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define por(i,a,b) for(int i=(a);i>(b);i--)
#define inn(x) (x<<1)
#define ouu(x) (x<<1|1)
using namespace std;
const int N=5e4+10,inf=1e9;
int TT,n,m,S,T,suml;
int l[N],c[N];
long long v[N];
struct node{
    int nx,to,c;
    long long w;
}e[N<<1];
int h[N],idx;

void add(int x,int y,int z,int w){
    e[idx].nx=h[x],e[idx].to=y,e[idx].c=z,e[idx].w=w,h[x]=idx++;
    e[idx].nx=h[y],e[idx].to=x,e[idx].c=0,e[idx].w=-w,h[y]=idx++;
}

int getid(int p,int x){
    return p*2*n+x;
}

void init(){
    memset(h,-1,sizeof(h));
    suml=idx=0;
}

long long dis[N];
int incf[N],vis[N],pre[N];
queue<int> q;

bool SPFA(){
	memset(incf,0,sizeof(incf));
	memset(dis,0x3f,sizeof(dis));
	q.push(S),incf[S]=inf,dis[S]=0;
	while(!q.empty()){
		int x=q.front();q.pop();
		vis[x]=0;
		for(int i=h[x];~i;i=e[i].nx){
			int y=e[i].to;
			if(e[i].c&&dis[y]>dis[x]+e[i].w){
				dis[y]=dis[x]+e[i].w;
				incf[y]=min(e[i].c,incf[x]);
				pre[y]=i;
				if(!vis[y]){
					vis[y]=1;
					q.push(y);
				}
			}
		}
	}
	return incf[T]>0;
}

long long EK(){
	long long cost=0;
	while(SPFA()){
		long long f=incf[T];
		cost+=f*dis[T];
		for(int i=T;i!=S;i=e[pre[i]^1].to)
			e[pre[i]].c-=f,e[pre[i]^1].c+=f;
	}
	return cost;
}

int main(){
    scanf("%d",&TT);
    while(TT--){
        S=0,T=N-3;
        scanf("%d%d",&n,&m);
        init();
        rep(i,1,m) scanf("%d",&l[i]),suml+=l[i];
        rep(i,1,2*n) scanf("%d",&c[i]);
        rep(i,1,2*n) scanf("%lld",&v[i]);
        if(suml>n){
            puts("-1");
            continue;
        }
        rep(x,1,2*n){
            add((n+2)*4*n+c[x],inn(getid(n+1,x)),1,0);
            add((n+2)*4*n+m+1,inn(getid(n+1,x)),1,0);
            add(inn(getid(n+1,x)),ouu(getid(n+1,x)),1,0);
            rep(p,0,n){
                if(p>x) break;
                if(p>(2*n-x)) break;
                if((p&1)^(x&1)) continue;
                add(inn(getid(p,x)),ouu(getid(p,x)),1,0);
                if(!p) add(ouu(getid(p,x)),T,1,0);
                else{
                    add(ouu(getid(p,x)),ouu(getid(p-1,x+1)),1,0);
                    add(ouu(getid(n+1,x)),inn(getid(p,x)),1,-v[x]);
                }
            }
        }
        rep(i,1,m) add(S,(n+2)*4*n+i,l[i],0);
        add(S,(n+2)*4*n+m+1,n-suml,0);
        printf("%lld\n",-EK());
    }
    return 0;
}