#include <bits/stdc++.h>
#define int long long
using namespace std;

void solve() {
	int n;
	cin >> n;

	vector<map<int, int>> mp(n + 1);
	vector<vector<int>> adj(n + 1);
	vector<int> in(n + 1);
	for (int i = 1; i <= n; i++) {
		int op;
		cin >> op;
		if (op == 1) {
			int k;
			cin >> k;
			for (int j = 1; j <= k; j++) {
				int x;
				cin >> x;
				mp[i][x]++;
			}
		} else {
			int x, y;
			cin >> x >> y;
			adj[i].push_back(x);
			adj[i].push_back(y);
			in[x]++;
			in[y]++;
		}
	}

	queue<int> q;
	q.push(n);

	vector<int> f(n + 1);
	f[n] = 1;
	while (q.size()) {
		int u = q.front();
		q.pop();
		for (int v : adj[u]) {
			f[v] += f[u];
			in[v]--;
			if (!in[v]) {
				q.push(v);
			}
		}
	}

	map<int, int> cnt;
	int tot = 0;
	for (int i = 1; i <= n; i++) {
		for (auto [u, v] : mp[i]) {
			tot += f[i] * v;
			cnt[u] += f[i] * v;
		}
	}

	int mx = 0;
	for (auto [u, v] : cnt) {
		mx = max(mx, v);
	}
	if (mx <= tot / 2) {
		cout << tot << "\n";
	} else {
		cout << tot - (mx - tot / 2) << "\n";
	}
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int T;
    cin >> T;
    while (T--) solve();

    return 0;
}