#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>

using namespace std;

const int N=200010;
int ans1,ans2,l,n,T;
int pre[N*2],to[N*2],nxt[N*2],cnt,d[N],s1,s2,s3,s4,s5,s6,ss,tt,ans,fa[N];

void makeedge(int x,int y)
{
    to[cnt]=y;nxt[cnt]=pre[x];pre[x]=cnt++;
    to[cnt]=x;nxt[cnt]=pre[y];pre[y]=cnt++;
}

int bfs1(int s,int no)
{
    int z=s;
    queue<int> q;
    while(!q.empty()) q.pop();
    for(int i=0;i<=n;i++) d[i]=0;
    q.push(s);
    d[s]=1;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(int p=pre[x];p!=-1;p=nxt[p])
        {
            int y=to[p];
            if(d[y]||y==no) continue;
            d[y]=d[x]+1;
            z=y;
            fa[y]=x;
            q.push(y);
        }
    }
    return z;
}
int dfs(int x,int no,int dep)
{
    if(d[x]==dep)
    {
        if(no==0)tt=fa[x];
        return x;
    }
    return dfs(fa[x],no,dep);
}

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        memset(pre,-1,sizeof(pre));
        cnt=0;
        scanf("%d",&n);
        for(int i=1;i<n;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            makeedge(x,y);
        }
        s1=bfs1(1,0);
        s2=bfs1(s1,0);
        ss=dfs(s2,0,(d[s2]+2)/2);
        s3=bfs1(ss,tt);
        s4=bfs1(s3,tt);
        ans1=dfs(s4,tt,(d[s4]+1)/2);
        ans=max(d[ans1]-1,d[s4]-d[ans1]);
        s5=bfs1(tt,ss);
        s6=bfs1(s5,ss);
        ans2=dfs(s6,ss,(d[s6]+1)/2);
        ans=max(ans,max(d[ans2]-1,d[s6]-d[ans2]));
        printf("%d %d %d\n",ans,ans1,ans2);
    }
}