#include<cstdio>
#include<cstring>
#include<iostream>
const int M = 1020;
const int N = 350;
using ll = long long;
const ll INF = 0x3f3f3f3f3f3f3f3f;
struct node{
    int fr,to,next,res,dis;
}q[M];
int head[N],ss,S,T,lst[N],que[N*M],flow[N];
ll dis[N],minc,maxf;bool inq[N];
void addedge(int x,int y,int v,int f)
{
    q[++ss]=(node){x,y,head[x],f, v};head[x]=ss;
    q[++ss]=(node){y,x,head[y],0,-v};head[y]=ss;
}
bool spfa()
{
    memset(flow,0x3f,sizeof(flow));
    memset(dis,0x3f,sizeof(dis));
    int f=1,e=0;
    dis[S]=0;
    que[++e]=S;
    while(f<=e)
    {
        int u=que[f++];inq[u]=false;
        for (int j=head[u];~j;j=q[j].next)
        {
            int t=q[j].to;
            if (q[j].res&&dis[t]>dis[u]+q[j].dis)
            {
                dis[t]=dis[u]+q[j].dis;
                flow[t]=std::min(flow[u],q[j].res);
                lst[t]=j;
                if (!inq[t]) que[++e]=t,inq[t]=true;
            }
        }
    }
    return dis[T]!=INF;
}
void mcmf()
{
    while(spfa())
    {
        minc += flow[T]*dis[T];
        maxf += flow[T];
        for (int i=T;i!=S;i=q[lst[i]].fr)
        {
            int j=lst[i];
            q[j].res-=flow[T];
            q[j^1].res+=flow[T];
        }
    }
}
int l[N],c[N],v[N],cnt[N];
int main()
{
    memset(head,-1,sizeof(head));ss=-1;
    int TT;
    scanf("%d",&TT);
    while(TT--)
    {
        int n,m;
        ll tot = 0;
        scanf("%d%d",&n,&m);
        for (int i=1;i<=m;++i) scanf("%d",&l[i]);
        for (int i=1;i<=2*n;++i) scanf("%d",&c[i]);
        for (int i=1;i<=2*n;++i) scanf("%d",&v[i]);
        for (int i=1;i<=2*n;++i) cnt[c[i]]++;
        S=0;
        for (int i=1;i<=m;++i)
        {
            if (cnt[i]<l[i])
            {
                printf("-1\n");
                goto GG;
            }
            addedge(S,i,0,cnt[i]-l[i]);
        } 
        for (int j=1;j<=2*n;++j)
            addedge(c[j], m+j, v[j], 1);
        for (int i=2;i<=2*n;++i)
            addedge(m+i, m+i+1, 0, i/2);
        T = m+2*n+1;
        for (int i=1;i<=2*n;++i) tot += v[i];
        mcmf();
        if (maxf!=n) printf("-1\n");
        else
            printf("%lld\n",tot-minc);
        GG:
        for (int i=S;i<=T;++i) head[i]=-1;
        for (int i=1;i<=m;++i) cnt[i]=0;
        ss=-1;minc=0;maxf=0;
    }
    return 0;
}