#pragma GCC optimize(3)
#include <cstdio>
#include <map>
#include <vector>
using namespace std;

typedef long long ll;

int read() {
    int x = 0;
    char c = getchar();
    for (; c < '0' || c > '9'; c = getchar());
    for (; c >= '0' && c <= '9'; c = getchar())
        x = (x << 1) + (x << 3) + (c ^ 48);
    return x;
}

int main() {
    int t = read();
    while (t--) {
        int n = read();
        vector<map<int, ll>> vec(n);
        for (int i = 0; i < n; i++) {
            int op = read();
            if (op == 1) {
                int k = read();
                for (int j = 1, x; j <= k; j++) vec[i][read()]++;
            } else {
                int x = read(), y = read();
                for (auto& [k, v] : vec[x - 1]) vec[i][k] += v;
                for (auto& [k, v] : vec[y - 1]) vec[i][k] += v;
            }
        }
        auto& g = vec[n - 1];
        ll last = 0, ans = 0;
        for (auto it = g.rbegin(); it != g.rend(); it++) {
            auto& [k, v] = *it;
            if (v >= last) {
                ans += last * 2;
                last = v - last;
            } else {
                ans += v * 2;
                last -= v;
            }
        }
        printf("%lld\n", ans);
    }
    return 0;
}
/*
2
1
1 5 3 3 2 1 3
3
1 3 3 3 2
1 4 2 2 3 3
2 1 2
*/