#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int read() {
    int x = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar());
    for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
    return x;
}

int main() {
    int t = read();
    while (t--) {
        int n = read(), tot = 0;
        vector<array<int, 1000000>> vec(n);
        unordered_map<int, int> id;
        for (int i = 0; i < n; i++) {
            if (read() == 1) {
                int k = read();
                for (int j = 1; j <= k; j++) {
                    int x = read();
                    if (!id.count(x)) id[x] = tot++;
                    vec[i][id[x]]++;
                }
            } else {
                int x = read(), y = read();
                for (int j = 0; j < 1e6; j++)
                    vec[i][j] = vec[x - 1][j] + vec[y - 1][j];
            }
        }
        auto& g = vec[n - 1];
        sort(g.begin(), g.end(), greater<int>());
        ll last = 0, ans = 0;
        for (auto& v : g) {
            if (!v) continue;
            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
*/