#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+5;
int n,type[N],sz[N],s1[N],s2[N];
int num,q[N],ne[N],hd[N];
int add[N],b[N];
void addnum(int x,int y){
	q[++num]=x;
	ne[num]=hd[y];
	hd[y]=num;
}
int dfs(int t){
	if(b[t])return add[t];
	if(type[t]==1){
		b[t]=1;
		return add[t];
	}
	add[t]=dfs(s1[t])+dfs(s2[t]);
	b[t]=1;
	return add[t];
}
int check(int x,int y){
	for(int i=1; i<=n; i++){
		add[i]=0;
		b[i]=0;
		if(type[i]==2)continue;
		for(int j=hd[i]; j; j=ne[j]){
			if(q[j]>=x&&q[j]<=y)add[i]++;
		}
	}
	return dfs(n);
}
signed main(){
	ios::sync_with_stdio(false);
	// synchronize with standard io false
	int t;
	cin>>t;
	while(t--){
		cin>>n;
		for(int i=1; i<=n; i++){
			cin>>type[i];
			if(type[i]==1){
				cin>>sz[i];
				for(int j=1; j<=sz[i]; j++){
					int x;
					cin>>x;
					addnum(x,i);
				}
			}else{
				cin>>s1[i]>>s2[i];
				sz[i]=sz[s1[i]]+sz[s2[i]];
			}
		}
		int l=1,r=1e9;
		while(l<r){
			int mid=(l+r)/2;
			if(check(1,mid)>sz[n]/2)r=mid;
			else l=mid+1;
		}
		int sum=check(l,l);
		if(sum<=sz[n]/2){
			cout<<sz[n]<<endl;
		}else{
			cout<<(sz[n]-sum)*2<<endl;
		}
	}
}