#include <bits/stdc++.h>

#define TMAX 100005
#define NMAX 11
#define MOD 666013

using namespace std;
typedef long long var;
int M[TMAX][NMAX][NMAX];

vector < pair < int , int > > G[NMAX][NMAX];
deque <  int > V;
vector < var > H[MOD];
bitset < NMAX > B;

ifstream fin("brazi.in");
ofstream fout("brazi.out");

void bfs(int n){
    int nod, p = 1;
    var a = 1;
    while(!V.empty()){
        nod = V.front();
        V.pop_front();
        if(G[n][nod].size() == 2){
            if(G[n][nod][0] == 0){
                a = a * p + 0;
            } else
        }

        for(int i = 0; i < G[n][nod].size(); i++){
            if(G[n][nod][i] == 0)
        }

    }

}




int main()
{
    ios :: sync_with_stdio(false);
    fin.tie(NULL);

    int n,T,x,y,p;

    fin >> T;

    for(int i = 1; i <= T; i++){
        fin >> n;
        for(int j = 1; j < n; j++){
            fin >> x >> y >> p;
            G[i][x].push_back({y,p});
            B[y] = 1;
        }
        for(int j = 1; j <= n; j++){
            if(B[j] == 0){
                V.push_back(j);
            }
            B[j] = 0;
        }

      //  bfs(i);


    }

    return 0;
}