#include<cstdio>

#include<queue>

#include<cstring>

#include<iostream>

#include<algorithm>

#define INF 99999999

using namespace std;

const int MAXN = ;

struct node

{

        int to;

        int v;

        int next;

}edge[MAXN*];

int p,len;

int num[MAXN];

int vis[MAXN],pre[MAXN],ind,n;

int siz[MAXN];//the size of the tree

int h[MAXN];//the maxnum of subtree

int way;

void add(int x,int y)

{

        edge[ind].to = y;

        edge[ind].next = pre[x];

        pre[x] = ind ++;

}

void dfs1(int rt)

{

        int i;

        vis[rt] = ;

        siz[rt] = ;

        for(i=pre[rt]; i!=-; i=edge[i].next){

                int t = edge[i].to;

                if(!vis[t]){

                        dfs1(t);

                        siz[rt] += siz[t];

                        h[rt] = max(h[rt],siz[t]);

                }

        }

}

int main()

{

        #ifndef ONLINE_JUDGE

        freopen("data.txt","r",stdin);

        #endif

        int i,j,t;

        scanf("%d",&t);

        while(t--)

        {

                scanf("%d",&n);

                ind = ;

                memset(pre,-,sizeof(pre));

                for(i=; i<n; i++){

                        int x,y;

                        scanf("%d%d",&x,&y);

                        add(x,y);

                        add(y,x);

                }

                memset(vis,,sizeof(vis));

                memset(siz,,sizeof(siz));

                memset(h,,sizeof(h));

                dfs1();

                int ans = INF;

                int f;

                for(i=; i<=n; i++){

                    int temp = max(h[i],n-siz[i]);

                    if(ans > temp){

                        ans = temp;

                        f = i;

                    }

                }

                //cout<<siz[1]<<endl;

                cout<<f<<" "<<ans<<endl;

        }

}