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

#define all(a) a.begin(), a.end()

using ll = long long;

const int N = 1e6 + 5;

ll cnt[N], dp[N];
bool vis[N];
vector<int> nums;

void solve () {
    int n;
    cin >> n;
    
    vector<vector<int>> s(n), e(n);
    for (int i = 0; i < n; i ++) {
        int op;
        cin >> op;
        
        if (op == 1) {
            int k;
            cin >> k;
            
            s[i].resize(k);
            for (int& x: s[i]) {
                cin >> x;
                nums.push_back(x);
            }
        } else {
            int x, y;
            cin >> x >> y;
            x --;
            y --;
            e[x].push_back(i);
            e[y].push_back(i);
        }
    }
    
    sort(all(nums));
    nums.erase(unique(all(nums)), nums.end());
    
    auto get = [&](int x) {
        return lower_bound(all(nums), x) - nums.begin();
    };
    
    dp[n - 1] = 1;
    
    auto dfs = [&](auto&& self, int u) -> ll {
        if (vis[u]) {
            return dp[u];
        }
        vis[u] = 1;
        for (int v: e[u]) {
            dp[u] += self(self, v);
        }
        return dp[u];
    };
    
    int m = nums.size();
    for (int i = 0; i < n; i ++) {
        dfs(dfs, i);
        if (dp[i]) {
            for (int x: s[i]) {
                x = get(x);
                cnt[x] += dp[i];
            }
        }
    }
    
    ll sum = 0;
    ll mx = 0;
    for (auto x: cnt) {
        sum += x;
        mx = max(mx, x);
    }
    cout << sum - max<ll>(0, mx * 2 - sum) << '\n';
    
    fill(cnt, cnt + m, 0);
    fill(dp, dp + n, 0);
    fill(vis, vis + n, 0);
    nums.clear();
}

int main () {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int t = 1;
    cin >> t;
    while (t --) {
        solve();
    }
    return 0;
}