#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

void solve() {
	int n;
	cin >> n;
	vector<vector<int>> adj(n + 1);
	vector<vector<i64>> input(n + 1);
	vector<i64> cnt(n + 1);
	for (int i = 1; i <= n; i++) {
		int op;
		cin >> op;
		if (op == 1) {
			int k;
			cin >> k;
			for (int j = 0; j < k; j++) {
				int x;
				cin >> x;
				input[i].emplace_back(x);
			}
		} else {
			int x, y;
			cin >> x >> y;
			adj[x].emplace_back(i);
			adj[y].emplace_back(i);
			// adj[i].emplace_back(x);
			// adj[i].emplace_back(y);
		}
	}
	vector<bool> vis(n + 1);
	cnt[n] = 1;
	vis[n] = 1;
	auto dfs = [&](auto self, int u, int fa) -> void {
		if (vis[u]) return;
		vis[u] = 1;
		for (auto v : adj[u]) {
			if (!vis[v]) {
				self(self, v, u);
			}
			cnt[u] += cnt[v];
		}
	};
	for (int i = 1; i <= n; i++) {
		if (!input[i].empty()) {
			dfs(dfs, i, 0);
		}
	}
	map<i64, i64> map;
	for (int i = 1; i <= n; i++) {
		if (!cnt[i]) continue;
		for (auto t : input[i]) {
			map[t] += cnt[i];
		}
	}	
	priority_queue<i64> q;
	for (auto [a, b] : map) {
		q.emplace(b);
	}
	i64 ans = 0;
	while (q.size() > 1) {
		i64 u = q.top();
		q.pop();
		i64 v = q.top();
		q.pop();
		ans += min(u, v);
		if (max(u, v) - min(u, v)) {
			q.emplace(max(u, v) - min(u, v));
		}
	}
	cout << ans * 2 << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	int t = 1;
	cin >> t;

	while (t--) {
		solve();
	}

	return 0;
}