#include <fstream>
#include <vector>
#include <algorithm>
#include <cstring>

using namespace std;

ifstream cin("zvon.in");
ofstream cout("zvon.out");

int t, n, viz[100005], dp[100005], tata[100005];
vector <int> a[100005];
bool cmp(int a, int b)
{
    return dp[a]>dp[b];
}

void dfs(int nod)
{
    viz[nod]=1;
    for(int i=0; i<a[nod].size(); ++i)
        if(!viz[a[nod][i]])
        {
            tata[a[nod][i]]=nod;
            dfs(a[nod][i]);
        }

    sort(a[nod].begin(), a[nod].end(), cmp);

    for(int i=0, nr=1; i<a[nod].size(); ++i)
        if(a[nod][i]!=tata[nod])
        {
            dp[nod]=max(dp[nod], dp[a[nod][i]]+nr);
            nr++;
        }
}
int main()
{

    cin>>t;
    while(t--)
    {
        cin>>n;
        for(int i=1; i<n; ++i)
        {
            int x, y;
            cin>>x>>y;
            a[x].push_back(y);
            a[y].push_back(x);
        }
        dfs(1);
        cout<<dp[1]<<'\n';
        memset(viz, 0, (n+1)*sizeof(int));
        memset(dp, 0, (n+1)*sizeof(int));
        for(int i=1; i<=n; ++i)
            a[i].clear();
    }
    return 0;
}