#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAXD 210
#define MAXM 20310
#define INF 0x3f3f3f3f
int M, N, first[MAXD], e, next[MAXM], v[MAXM], flow[MAXM];
int S, T, SUM, d[MAXD], q[MAXD], work[MAXD];
void add(int x, int y, int z)
{v[e] = y, flow[e] = z;next[e] = first[x], first[x] = e ++;
}
void init()
{int i, j, x, n;scanf("%d%d", &M, &N);S = 0, T = M + N + 1;memset(first, -1, sizeof(first[0]) * (T + 1));e = 0;SUM = 0;for(i = 1; i <= M; i ++){scanf("%d", &x), SUM += x;add(S, i, x), add(i, S, 0);    }for(i = 1; i <= N; i ++){scanf("%d", &x);add(M + i, T, x), add(T, M + i, 0);}for(i = 1; i <= M; i ++){scanf("%d", &n);for(j = 0; j < n; j ++){scanf("%d", &x);add(i, M + 1 + x, INF), add(M + 1 + x, i, 0);}}
}
int bfs()
{int i, j, rear = 0;memset(d, -1, sizeof(d[0]) * (T + 1));d[S] = 0, q[rear ++] = S;for(i = 0; i < rear; i ++)for(j = first[q[i]]; j != -1; j = next[j])if(flow[j] && d[v[j]] == -1){d[v[j]] = d[q[i]] + 1, q[rear ++] = v[j];if(v[j] == T) return 1;    }return 0;
}
int dfs(int cur, int a)
{if(cur == T)return a;int t;for(int &i = work[cur]; i != -1; i = next[i])if(flow[i] && d[v[i]] == d[cur] + 1)if(t = dfs(v[i], std::min(a, flow[i]))){flow[i] -= t, flow[i ^ 1] += t;return t;    }return 0;
}
int dinic()
{int ans = 0, t;while(bfs()){memcpy(work, first, sizeof(first[0]) * (T + 1));while(t = dfs(S, INF))ans += t;    }return ans;
}
void solve()
{printf("%d\n", SUM - dinic());
}
int main()
{int t;scanf("%d", &t);while(t --){init();solve();    }return 0;
}