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

typedef long long ll;

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        int n;
        scanf("%d", &n);
        vector<map<int, ll>> vec;
        for (int i = 0; i < n; i++) {
            int op;
            scanf("%d", &op);
            if (op == 1) {
                int k;
                scanf("%d", &k);
                map<int, ll> mp;
                for (int j = 1, x; j <= k; j++) {
                    scanf("%d", &x);
                    mp[x] += 1;
                }
                vec.emplace_back(mp);
            } else {
                int x, y;
                scanf("%d%d", &x, &y);
                map<int, ll> mp;
                for (auto& [k, v] : vec[x - 1]) mp[k] += v;
                for (auto& [k, v] : vec[y - 1]) mp[k] += v;
                vec.emplace_back(mp);
            }
        }
        auto& g = vec[n - 1];
        ll last = 0;
        ll 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
*/