#include <stdio.h>
#include <vector>
#include <stdio.h>
#include <string.h>

using namespace std;

#define NMAX 205
#define pb push_back
#define sz size()
#define mp make_pair
#define INF 0x3f3f3f3f

int C[NMAX][NMAX];
int F[NMAX][NMAX];
int TT[NMAX];
vector<int> G[NMAX];
int N, M;
int cd[NMAX];
int viz[NMAX];

int BF()
{
    int i, j, nod, V;

    cd[0] = 1;
    cd[1] = 1;
    memset(viz, 0, sizeof(viz));
    viz[1] = 1;

    for (i = 1; i <= cd[0]; i++)
    {
        nod = cd[i];
        if (nod == N) continue;
        for (j = 0; j < G[nod].sz; j++)
            {
                V = G[nod][j];
                if (C[nod][V] == F[nod][V] || viz[V]) continue;
                viz[V] = 1;
                cd[ ++cd[0] ] = V;
                TT[V] = nod;
            }
    }

    return viz[N];
}

int main()
{
    freopen("tribut.in", "r", stdin);
    freopen("tribut.out", "w", stdout);


    int test_cnt;
    int system_cnt;
    int union_cnt;
    int cost, cnt, system, flow;

    scanf("%d", &test_cnt);

    while (test_cnt--) {

        scanf("%d", &system_cnt);
        scanf("%d", &union_cnt);

        N = system_cnt + union_cnt + 2;
        for (int i = 1; i <= N; i++) {
            G[i].clear();
            for (int j = 1; j <= N; j++) {
                C[i][j] = 0;
                F[i][j] = 0;
            }
        }

        for (int i = 2; i < system_cnt + 2; i++) {
            scanf("%d", &cost);
            C[1][i] += cost;
            G[1].pb(i);
            G[i].pb(1);
        }

        for (int i = system_cnt + 2; i < N; i++) {
            scanf("%d", &cnt);
            scanf("%d", &cost);

            C[i][N] += cost;
            G[i].pb(N);
            G[N].pb(i);

            for (int j = 1; j <= cnt; j++) {
                scanf("%d", &system);

                system++;
                C[system][i] += cost;
                G[system].pb(i);
                G[i].pb(system);
            }
        }

        for (flow = 0; BF();)
        {
            for (int i = 0; i < G[N].sz; i++)
            {
                int nod = G[N][i];
                if (F[nod][N] == C[nod][N] || !viz[nod]) continue;
                TT[N] = nod;

                int fmin = INF;
                for (nod = N; nod != 1; nod = TT[nod])
                    fmin = min(fmin, C[ TT[nod] ][nod] - F[ TT[nod] ][nod]);
                if (fmin == 0) continue;

                for (nod = N; nod != 1; nod = TT[nod])
                {
                    F[ TT[nod] ][nod] += fmin;
                    F[nod][ TT[nod] ] -= fmin;
                }

                flow += fmin;
            }
        }

        printf("%d\n", flow);
    }

    return 0;
}