#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("zvon.in");
ofstream fout("zvon.out");
const int Nmax=100005;
vector <int> G[Nmax];
int T,Level[Nmax],N,maxx=-1,nr;


void Read()
{
    fin>>N;
    for(int i=1;i<N;++i)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
}


void DFS(int Nod,int Father)
{
    for(unsigned int j=0;j<G[Nod].size();++j)
    {
        int Vecin=G[Nod][j];
        if(Vecin==Father)
            continue;
            Level[Vecin]=Level[Nod]+1;
        DFS(Vecin,Nod);
    }
}

int main()
{
    fin>>T;
    while(T--)
    {
    Read();
    DFS(1,0);
    maxx=-1;nr=0;
    for(int i=1;i<=N;++i)
    {
         if(Level[i]==maxx)
        {
            nr++;
        }
        if(Level[i]>maxx)
        {
            maxx=Level[i];
            nr=0;
        }

    }
    fout<<maxx+nr<<"\n";
     for(int j=1;j<=N;++j)
    {
        G[j].clear();
    }
    }
    return 0;
}