#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;
vector<int> e[1000005];
vector<int> sq[1000000 + 1];
int deg[1000005];
map<int, int> ma;
vector<int> tp(1000005);
int vis[1000005];
int n;
void bfs(int u)
{

    queue<int> q;
    for (int i = 1; i <= n; i++)
    {
        if (deg[i] == 0)
        {
            q.push(i);
            tp[i] = 1;
        }
    }

    while (!q.empty())
    {

        int t = q.front();
        q.pop();
        // cout << t << '\n';
        for (auto v : e[t])
        {
            // cout << v << '\n';
            tp[v] += tp[t];
            deg[v]--;

            if (deg[v] == 0)
            {
                q.push(v);
            }
        }
    }

    return;
}
void solve()
{
    cin >> n;
    for (int i = 1; i <= n + 1; i++)
        e[i].clear(), sq[i].clear(), tp[i] = 0, deg[i] = 0, vis[i] = 0;
    ma.clear();
    for (int i = 1; i <= n; i++)
    {
        int op;
        cin >> op;
        if (op == 1)
        {
            int len;
            cin >> len;
            sq[i].resize(len);
            for (int j = 1; j <= len; j++)
            {
                int x;
                cin >> x;
                sq[i][j - 1] = x;
            }
        }
        else
        {
            int x, y;
            cin >> x >> y;
            e[i].push_back(x);
            e[i].push_back(y);
            deg[x]++;
            deg[y]++;
        }
    }
    // cout << "SS\n";
    ll sum = 0;
    ll mx = 0;
    bfs(n);
    for (int i = 1; i <= n; i++)
    {
        if (!sq[i].empty() && tp[i] > 0)
        {
            for (auto v : sq[i])
                ma[v] += tp[i];
        }
    }
    for (auto v : ma)
    {
        sum += v.second;
        mx = max(mx, v.second * 1LL);
    }
    // cout << sum << " " << mx << '\n';
    if (mx > sum - mx)
    {
        cout << 2LL * (sum - mx) << '\n';
    }
    else
    {
        cout << sum << '\n';
    }
}
int main()
{
    IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
    clock_t start_time = clock();
#endif
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}