#include<bits/stdc++.h>
using namespace std;
using s64 = long long;
const int MN = 315;
namespace MCMF {
    const int inf = 0x7fffffff;
    typedef pair<s64, int> P;
    int S, T;
    int cnt = 1, n;
    int h[MN], cur[MN];
    bool vis[MN];
    s64 dis[MN], ep[MN];
    struct edge {
        int to, nxt, f, w;
    }e[MN << 1]; // remind size of edge
    void insw(int x, int y, int f, int c) {
        e[++cnt].nxt = h[x]; h[x] = cnt; e[cnt].to = y; e[cnt].f = f; e[cnt].w = c;
        e[++cnt].nxt = h[y]; h[y] = cnt; e[cnt].to = x; e[cnt].f = 0; e[cnt].w = -c;
    }
    void init(int N, int s = -1, int t = -1) {
        n = N;
        if(s == -1) S = ++n;
        else S = s;
        if(t == -1) T = ++n;
        else T = t;
        cnt = 1;
        fill(h, h + 1 + n, 0);
    }
    void SPFA() {
        fill(ep, ep + 1 + n, 0);
        fill(vis, vis + 1 + n, 0);
        deque<int> que;
        for(int i = 1; i <= n; i++) que.push_back(i), vis[i] = 1;
        while(!que.empty()) {
            int x = que.front();
            que.pop_front();
            vis[x] = 0;
            for(int i = h[x]; i; i = e[i].nxt) {
                int y = e[i].to;
                if(!e[i].f || ep[y] <= ep[x] + e[i].w) continue;
                ep[y] = ep[x] + e[i].w;
                if(!vis[y]) {
                    vis[y] = 1;
                    if(!que.empty() && ep[y] < ep[que.front()]) que.push_front(y);
                    else que.push_back(y);
                }
            }
        }
        return;
    }
    bool dijkstra() {
        fill(dis, dis + 1 + n, -1);
        dis[S] = 0;
        priority_queue<P, vector<P>, greater<P>> pq;
        pq.push(P(0, S));
        while(!pq.empty()) {
            s64 dd= pq.top().first; int x = pq.top().second;
            pq.pop();
            if(dd != dis[x]) continue;
            for(int i = h[x]; i; i = e[i].nxt) {
                if(!e[i].f) continue;
                int y = e[i].to;
                if(dis[y] != -1 && dis[y] <= dd + e[i].w + ep[x] - ep[y]) continue;
                dis[y] = dd + e[i].w + ep[x] - ep[y];
                pq.push(P(dis[y], y));
            }
        }
        memcpy(cur, h, (n + 2) << 2);
        return dis[T] != -1;
    }
    int Dinic(int x, int f, s64 &nowc) {
        if(x == T) return f;
        vis[x] = 1;
        int ret = 0;
        for(int &i = cur[x]; i; i = e[i].nxt) {
            int y = e[i].to;
            if(vis[y] || !e[i].f || dis[y] != dis[x] + e[i].w + ep[x] - ep[y]) continue;
            int u = Dinic(y, min(f, e[i].f), nowc);
            ret += u; f -= u;
            e[i].f -= u; e[i ^ 1].f += u;
            nowc += (s64)e[i].w * u;
            if(!f) break;
        }
        vis[x] = 0;
        return ret;
    }
    P calc() { // return {cost, flow}
        SPFA();
        // for(int i = 1; i <= n; i++) cerr << i << " : " << ep[i] << '\n';
        P ret(0, 0);
        while(dijkstra()) {
            ret.second += Dinic(S, inf, ret.first);
            for(int i = 1; i <= n; i++) ep[i] += dis[i];
        }
        return ret;
    }
}
int n, m, l[MN], c[MN];
s64 v[MN];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while(T--) {
        cin >> n >> m;
        MCMF::init(2 * n + m + 1);
        for(int i = 1; i <= m; i++) {
            cin >> l[i];
        }
        vector tong(m + 1, vector<int>());
        vector<int> du(2 * n + m + 5, 0);
        for(int i = 1; i <= 2 * n; i++)
            cin >> c[i], tong[c[i]].push_back(i);
        for(int i = 1; i <= 2 * n; i++)
            cin >> v[i];
        v[2 * n + 1] = 0;
        s64 ans = 0;
        int need = 0;
        int s = 2 * n + m + 1;
        for(int i = 1; i <= m; i++) {
            MCMF::insw(s, i + 2 * n, n - l[i], 0);
            du[s] -= l[i];
            du[i + 2 * n] += l[i];
            // ans += -l[i] * v[i];
        }
        for(int i = 1; i <= 2 * n; i++) {
            int nxt = (i == 2 * n ? s : (i + 1));
            MCMF::insw(i, nxt, n - (i + 1) / 2, 0);
            MCMF::insw(2 * n + c[i], i, 1, -v[i]);
            du[i] -= (i + 1) / 2;
            du[nxt] += (i + 1) / 2;
        }
        for(int i = 1; i <= s; i++) {
            if(du[i] > 0) MCMF::insw(MCMF::S, i, du[i], 0), need += du[i];
            if(du[i] < 0) MCMF::insw(i, MCMF::T, -du[i], 0);
        }
        auto [tmpc, tmpf] = MCMF::calc();
        ans += tmpc;
        // cerr << tmpc << ' ' << tmpf << '\n';
        if(need == tmpf) cout << -ans << '\n';
        else cout << "-1\n";
    }
}