#include<bits/stdc++.h>
using namespace std;
int q;
int l[1001001],r[1001001];
vector<int>g[1001001];
int f[1001001],sz[1001001];
map<int,int>ct;
void solve(){
	cin>>q;
	ct.clear();
	int mx,op,n;
	for (int i=1;i<=q;i++){
		g[i].clear();l[i]=r[i]=f[i]=sz[i]=0;
		cin>>op;
		if(op==1){
			cin>>n;
			for (int j=1,x;j<=n;j++)
			cin>>x,g[i].push_back(x);
			sz[i]=n;
		}else{
			cin>>l[i]>>r[i];
			sz[i]=sz[l[i]]+sz[r[i]];
		}
	}
	f[q]=1;
	for (int i=q;i;i--){
		if(l[i]!=0){
			f[l[i]]+=f[i],f[r[i]]+=f[i];
		}else{
			for (auto j:g[i])
			ct[j]+=f[i],mx=max(mx,ct[j]);
		}
	}
//	cout<<mx<<"****\n";
	cout<<min((sz[q]-mx)*2,sz[q])<<"\n";
}
int main(){
	int T;cin>>T;
	while(T--)solve();
}