#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;
int n, T, t;
struct Node {
	int op, x, y;
} ask[N];
vector<int> a[N];
int len[N];
long long tot[N];
bool vis[N];
priority_queue<int> q;
unordered_map<int, long long> mp;
inline int read() {
	int s = 0;
	char c = getchar();
	while (c < '0' || c > '9') {
		c = getchar();
	}
	while (c >= '0' && c <= '9') {
		s = s * 10 + c - '0';
		c = getchar();
	}
	return s;
}
int main()
{
	ios::sync_with_stdio(false);cin.tie();cout.tie();
	cin>>T;
	while (T--) {
		cin>>n;
		for (int i = 1; i <= n; i++) {
			cin>>ask[i].op;
			if (ask[i].op == 1) {
				a[i].clear();
				cin>>len[i];
				for (int j = 1; j <= len[i]; j++) {
					cin>>t;
					a[i].push_back(t);
				}
			}
			else {
				cin>>ask[i].x>>ask[i].y;
			}
		}
		q.push(n); vis[n] = 1;
		tot[n] = 1;
		for (int i = n - 1; i >= 1; i--) {
			int tp = q.top(); 
			q.pop();
			if (ask[tp].op == 1) continue;
			if (!vis[ask[tp].x]) q.push(ask[tp].x), vis[ask[tp].x] = 1;
			if (!vis[ask[tp].y]) q.push(ask[tp].y), vis[ask[tp].y] = 1;
			tot[ask[tp].x] += tot[tp];
			tot[ask[tp].y] += tot[tp];
		}
		for (int i = 1; i <= n; i++) {
			if (ask[i].op == 2) continue;
			for (int j = 0; j < len[i]; j++) {
				mp[a[i][j]] += tot[i];
			}
		}
		long long t=0,ans=0;
		for (unordered_map<int,long long>::iterator it=mp.begin();it!=mp.end();it++) {
			if (it->second >= n / 2)t=it->second;
			ans+=it->second;
		}
		if(!t)cout<<ans<<endl;
		else cout<<ans*2-t*2<<endl;
		mp.clear();while(!q.empty())q.pop();
		for(int i=1;i<=n;i++)tot[i]=vis[i]=0;
	}
	return 0;
}