#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define endl '\n'

void solve()
{
    int n;
    cin>>n;
    vector<vector<ll>> arr(n+1);
    vector<pii> b(n+1);
    ll i,j,k;
    for(i=1;i<=n;i++)
    {
        int op;
        cin>>op;
        if(op==1)
        {
            int m;
            cin>>m;
            arr[i].resize(m);
            for(j=0;j<m;j++)
                cin>>arr[i][j];
        }
        else    // op==2
            cin>>b[i].first>>b[i].second;
    }

    if(!b[n].first)
    {
        ll mx=0;
        map<ll,ll> mp;
        for(auto x:arr[n])
            mx=max(mx,++mp[x]);
        if(2LL*mx<=arr[n].size())
            cout<<arr[n].size()<<endl;
        else
            cout<<2LL*(arr[n].size()-mx)<<endl;
        return;
    }

    vector<ll> dp(n+1);
    dp[n]=1;
    auto fun=[&](auto fun, int u)
    {
        auto [x,y]=b[u];
        if(!x)
            return;
        dp[x]+=dp[u], dp[y]+=dp[u];
        fun(fun,x), fun(fun,y);
    };
    fun(fun,n);
    ll mx=0, cnt=0;
    map<ll,ll> mp;
    for(i=1;i<=n;i++)
    {
        if(!dp[i] || arr[i].empty())
            continue;
        for(auto x:arr[i])
        {
            mp[x]+=dp[i];
            cnt+=dp[i];
            mx=max(mx,mp[x]);
        }
    }
    if(2LL*mx<=cnt)
        cout<<cnt<<endl;
    else
        cout<<2LL*(cnt-mx)<<endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int T;
    cin>>T;
    while(T--)
        solve();
}