#include<bits/stdc++.h>
#define ll long long
#define db long double
#define mk make_pair
#define eb emplace_back 
#define fo(i,a,b) for(ll (i)=(a);(i)<=(b);(i)++)
#define fd(i,a,b) for(ll (i)=(a);(i)>=(b);(i)--)
using namespace std;
const int N=1e6+10;
const int mo=1e9+7;
ll n,op[N],k,x,y,d[N],f[N];
vector<int> e[N],p[N];
queue<int> q;
map<int,ll> mp;
void solve(){
    cin>>n;
    fo(i,1,n) f[i]=d[i]=0,e[i].clear(),p[i].clear();
    fo(i,1,n)
    {
        cin>>op[i];
        if(op[i]==1){
            cin>>k;
            fo(j,1,k) cin>>x,p[i].eb(x);
        }
        else {
            cin>>x>>y;
            d[x]++;d[y]++;
            e[i].eb(x);
            e[i].eb(y);
        }
    }   
    q.push(n); f[n]=1;
    while(!q.empty()){
        int x=q.front();q.pop();
        for(auto y:e[x]){
            d[y]--;
            f[y]+=f[x];
            if(d[y]==0){
                q.push(y);
            }
        }
    }
    mp.clear();
    ll ans=0,len=0;
    fo(i,1,n){
        // cout<<f[i]<<"\n";
        if(f[i] && op[i]==1){
            for(auto y:p[i]) mp[y]+=f[i];
            len+=f[i]*p[i].size();
        }
    }
    for(auto it:mp) {
        ans=max(ans,it.second);
    }
    if(ans*2>=len) cout<<2*(len-ans)<<"\n";
    else cout<<len<<"\n";
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int T;
    cin>>T;
    while(T--) solve();
    return 0;
}