#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

#define newn a[x][i]

using namespace std;

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

const int N = 16005;

long t, n, m, jos[N], h[N], sus[N], dis[N];
vector <long> a[N], di[N], tat(N), dt(N);
vector <bool> viz(N);

void dfs(int x, int dis)
{
    int maxim = 0;
    viz[x] = 1;
    h[x] = jos[x] = dis;

    for(unsigned i=0; i<a[x].size(); i++)
        if(!viz[newn])
        {
            tat[newn] = x;
            dt[newn] = di[x][i];
            dfs(newn, dis+di[x][i]);
            jos[x] = max(jos[x], h[newn]);
        }
    jos[x] -= h[x];
    h[x] += jos[x];
}

void dfs2(int x)
{
    viz[x] = 1;
    sus[x] = dt[x] + sus[tat[x]];
    int tata = tat[x];
    for(unsigned i=0; i<a[tata].size(); i++)
        if(a[tata][i] != x)
        sus[x] = max(sus[x], dt[x] + dt[a[tata][i]] + jos[a[tata][i]]);

    for(unsigned i=0; i<a[x].size(); i++)
        if(!viz[newn])
            dfs2(newn);
}

int main()
{
    fin>>t;
    for(int i=1; i<=t; i++)
    {
        fout<<"Testul nr #"<<i<<'\n';

        fin>>n;
        for(int j=1; j<n; j++)
        {
            int x, y, c;
            fin>>x>>y>>c;
            di[x].push_back(c);
            di[y].push_back(c);
            a[x].push_back(y);
            a[y].push_back(x);
        }

        dfs(1, 0);

        for(int j=1; j<=n; j++)
            viz[j] = 0;
        sus[1] = 0;
        for(unsigned j=0; j<a[1].size(); j++)
            dfs2(a[1][j]);

        int minim = (1 << 30);
        for(int j=1; j<=n; j++)
        {
            dis[j] = max(jos[j], sus[j]);
            if(minim > dis[j]) minim = dis[j];
        }

        for(int j=1; j<=n; j++)
            if(dis[j] == minim) fout<<j<<'\n';

        for(int j=1; j<=n; j++)
        {
            di[j].clear(); a[j].clear();
            viz[j] = 0;
        }

    }
    return 0;
}