#include <bits/stdc++.h>

using namespace std;

using ll = long long;

#define int long long
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

const long long mod = 1e9 + 7;

void solve() {
    int n;
    cin >> n;
    vector<int> ct(n);
    ct[n - 1] = 1;
    vector<vector<int>> a(n);
    for (int i = 0; i < n; ++i) {
        int t;
        cin >> t;
        if (t == 2) {
            a[i].push_back(-1);
            int lol, kek;
            cin >> lol >> kek;
            a[i].push_back(lol);
            a[i].push_back(kek);
        }
        else {
            int nn;
            cin >> nn;
            for (int j = 0; j < nn; ++j) {
                int x;
                cin >> x;
                a[i].push_back(x);
            }
        }
    }
    map<int, int> ctt;
    for (int i = n - 1; i >= 0; --i) {
        if (a[i][0] == -1) {
            ct[a[i][1] - 1] += ct[i];
            ct[a[i][2] - 1] += ct[i];
        }
        else {
            for (auto e : a[i]) ctt[e] += ct[i];
        }
    }
    int S = 0;
//    cout << S << endl;
    for (auto e : ctt) S += e.second;
    int ans = 0;
    for (auto e : ctt) ans = max(ans, e.second - S / 2);
    cout << S - (ans * 2) + S % 2 << '\n';
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--)
        solve();
}