#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#define int long long
typedef long long ll;
using namespace std;
const int MX=105;
const int inf=0x7fffffff;

int N, M, S, T;
int head[3*MX], cnt=1;
int l[MX], col[2*MX], val[2*MX];
int d[3*MX], dis[3*MX], pre[3*MX];
bool vis[3*MX];
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
struct edge{int nxt, to, c, w;}e[30*MX*MX];
inline void ae(int u, int v, int c, int w)
{
    // cout << "ae:" << u << " " << v << " " << c << " " << w << '\n';
    e[++cnt].to=v; e[cnt].nxt=head[u]; head[u]=cnt; e[cnt].c=c; e[cnt].w=w;
    e[++cnt].to=u; e[cnt].nxt=head[v]; head[v]=cnt; e[cnt].c=0; e[cnt].w=-w;
}
bool spfa()
{
    memset(dis,0x3f,sizeof(dis)); //min cost
    memset(d,0,sizeof(d)); //max flow;
    queue<int> q;
    q.push(S); dis[S]=0; d[S]=inf;
    while(!q.empty())
    {
        int x=q.front(); q.pop();
        // cout << "X=" << x << '\n';
        vis[x]=0;
        for(int i=head[x];i;i=e[i].nxt)
        {
            int y=e[i].to;
            if(!e[i].c||dis[y]<=dis[x]+e[i].w) continue;
            dis[y]=dis[x]+e[i].w;
            d[y]=min(d[x],e[i].c);
            pre[y]=i;
            if(vis[y]) continue;
            vis[y]=1; q.push(y);
            // if(dis[y]>-100) cout << "x=" << x << ", y=" << y << ", dis=" << dis[y] << '\n';
        }
    } 
    return d[T]>0;
}
pair<int,int> EK()
{
    int flow=0; ll cost=0;
    while(spfa())
    {
        // cout << "SPIN\n";
        flow+=d[T]; cost+=(ll)(d[T]*dis[T]);
        for(int i=T;i!=S;i=e[pre[i]^1].to)
        {
            // cout << "i=" << i << '\n';
            e[pre[i]].c-=d[T];
            e[pre[i]^1].c+=d[T];
        }
        // cout << "SPOUT\n";
        // cout << flow << " " << cost << '\n';
    }
    return {flow,cost};
}
signed main()
{
    // freopen("testdata.in","r",stdin);
    int times=read();
    while(times--)
    {
        N=read(); M=read(); S=M+2*N+1; T=S+1;
        int sum=0; ll tar=0;
        for(int i=1;i<=M;i++) 
        {
            l[i]=read(); 
            sum+=l[i];
            ae(S,i,l[i],-inf);
            ae(S,i,N,0);
        }
        tar+=(ll)(sum*(-inf));
        for(int i=1;i<=2*N;i++)
            col[i]=read();
        for(int i=1;i<=2*N;i++) 
        {
            val[i]=read();
            ae(col[i],i+M,ll(1),-val[i]);
        }
        for(int i=1;i<2*N;i++)
        {
            ae(i+M,i+M+1,N,0);
            ae(i+M,i+M+1,(i+1)/2,-inf);
            tar+=((i+1)/2)*(-inf);
        }
        ae(M+2*N,T,N,0);
        ll ans=EK().second;
        if(ans>tar||sum>N) cout << "-1\n";
        else cout << -(ans-tar) << '\n';
        for(int i=1;i<=2*N+M+2;i++) head[i]=0; cnt=1;
    }
    return (0-0);
}