#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

struct Info{
    ll u, v;
    Info(ll u, ll v) : u(u), v(v){}

    friend Info operator+(Info lhs, Info rhs){
        if(lhs.u == rhs.u)lhs.v += rhs.v;
        else{
            if(lhs.v < rhs.v)swap(lhs, rhs);
            lhs.v -= rhs.v;
        }
        return lhs;
    }
};

void solve(){
    int n;
    cin >> n;

    vector<Info> a(n, Info{0, 0});
    vector<vector<int>> val(n);
    vector<array<int, 2>> merge(n);
    for(int i = 0; i < n; i++){
        int op;
        cin >> op;

        if(op == 1){
            int s;
            cin >> s;

            vector<int> now(s);
            for(int j = 0; j < s; j++){
                cin >> now[j];

                a[i] = a[i] + Info{now[j], 1};
            }
            val[i] = now;
        } else{
            int x, y;
            cin >> x >> y;
            x--, y--;

            a[i] = a[x] + a[y];
            merge[i] = {x, y};
        }
    }

    ll C = a[n - 1].u;

    vector<ll> num(n), sz(n);
    for(int i = 0; i < n; i++){
        if(val[i].size()){
            for(auto x : val[i])num[i] += (x == C);
            sz[i] = val[i].size();
        } else{
            num[i] += num[merge[i][0]] + num[merge[i][1]];
            sz[i] = sz[merge[i][0]] + sz[merge[i][1]];
        }
    }

    // cout << sz[n - 1] - max(0ll, num[n - 1] - sz[n - 1] / 2) << "\n";
    cout << (num[n - 1] > sz[n - 1] / 2 ? 2 * (sz[n - 1] - num[n - 1]) : sz[n - 1]) << "\n";
    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while(t--)solve();
    return 0;
}