#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 200 + 5;

int N, M, a[MAX_N], b[MAX_N], c[MAX_N];
vector <int> G[MAX_N];
int mat[MAX_N], A[MAX_N], B[MAX_N], C[MAX_N], ans;

void dfs(int i, int res) {
    if (res > ans) return ;
    if (i > N) {
        ans = min(ans, res);
        return ;
    }
    vector <pair <int, int>> candidate(0);
    for (auto x : G[i]) {
        if (A[x] != a[x]) {
            candidate.emplace_back(0, x);
        }else if (B[x] != b[x]) {
            candidate.emplace_back(B[x] & 1, x);
        }else if (C[x] != c[x]) {
            candidate.emplace_back(1, x);
        }
    }
    sort(candidate.begin(), candidate.end());
    for (auto [cost, x] : candidate) {
        int ty;
        if (A[x] != a[x]) {
            A[x] ++; ty = 1;
        }else if (B[x] != b[x]) {
            B[x] ++; ty = 2;
        }else if (C[x] != c[x]) {
            C[x] ++; ty = 3;
        }
        dfs(i + 1, res + cost);
        if (ty == 1) {
            A[x] --;
        }else if (ty == 2) {
            B[x] --;
        }else {
            C[x] --;
        }
    }
}

void solve() {
    scanf("%d%d", &N, &M);
    int sum = 0;
    for (int i = 1; i <= M; i ++) {
        int n;
        scanf("%d%d%d%d", a + i, b + i, c + i, &n);
        A[i] = B[i] = C[i] = 0;
        for (int j = 1; j <= n; j ++) {
            int x;
            scanf("%d", &x);
            G[x].push_back(i);
        }
        sum += b[i] + c[i];
    }
    ans = 0x3f3f3f3f;
    dfs(1, 0);
    if (ans < 0x3f3f3f3f) printf("%d\n", sum - ans);
    else printf("-1\n");
}

int main() {
    int T;
    scanf("%d", &T);
    while (T --) solve();
    return 0;
}