#include <bits/stdc++.h>

using namespace std;

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
#define pll pair<ll, ll>
#define pii pair<int, int>
#define vi vector<int>
#define fir(i, a, b) for (int i = a; i <= b; i++)
#define pqi priority_queue<int> // 优先队列

#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
// #define int long long

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

    std::vector<std::vector<int>> q(n);
    std::vector<int> k(n), x(n), y(n), o(n), m(n);
    std::vector<i64> len(n), c(n);
    for (int i = 0; i < n; i++)
    {
        std::cin >> o[i];
        if (o[i] == 1)
        {
            std::cin >> k[i];
            q[i].resize(k[i]);
            for (int j = 0; j < k[i]; j++)
            {
                std::cin >> q[i][j];
                if (m[i] == q[i][j] || c[i] == 0)
                {
                    m[i] = q[i][j];
                    c[i]++;
                }
                else
                {
                    c[i]--;
                }
            }
            len[i] = k[i];
        }
        else
        {
            std::cin >> x[i] >> y[i];
            x[i]--;
            y[i]--;
            len[i] = len[x[i]] + len[y[i]];
            if (m[x[i]] == m[y[i]])
            {
                m[i] = m[x[i]];
                c[i] = c[x[i]] + c[y[i]];
            }
            else if (c[x[i]] > c[y[i]])
            {
                m[i] = m[x[i]];
                c[i] = c[x[i]] - c[y[i]];
            }
            else
            {
                m[i] = m[y[i]];
                c[i] = c[y[i]] - c[x[i]];
            }
        }
    }

    int v = m[n - 1];
    for (int i = 0; i < n; i++)
    {
        if (o[i] == 1)
        {
            c[i] = 0;
            for (auto x : q[i])
            {
                c[i] += (x == v);
            }
        }
        else
        {
            c[i] = c[x[i]] + c[y[i]];
        }
    }

    i64 ans = std::min(len[n - 1], 2 * (len[n - 1] - c[n - 1]));
    std::cout << ans << "\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    std::cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}