#include <cstdio>
#include <vector>
#include <bitset>
#include <queue>

#define maxN 100001

using namespace std;

int Tt;
int N;
int Nr[maxN];
int T[maxN];

struct elem
{
    int nod;
    int nv;
};

class comp
{
    public:
        bool operator()(elem a, elem b)
        {
            return a.nv < b.nv;
        }
};

vector <int> V[maxN];
queue <int> q;
priority_queue<elem, vector <elem>, comp> pq;

void df(int nod)
{
//    ++ Nr[nod];

    int i;
    for(i=0; i<V[nod].size(); ++i)
    {
        df(V[nod][i]);

        if(V[V[nod][i]].size() == 0) Nr[V[nod][i]] = 1;
        
        Nr[nod] += Nr[V[nod][i]];
    }
}

void bfs()
{
    q.push(1);

    int nod, i, k;
    elem x;

    while(q.empty() == false)
    {
        nod = q.front();
        q.pop();

        for(i=0; i<V[nod].size(); ++i)
        {
            x.nod = V[nod][i];
            x.nv = Nr[x.nod];
            pq.push(x);
        }

        k = 1;

        while(pq.empty() == false)
        {
            x = pq.top();
            pq.pop();
            q.push(x.nod);

            T[x.nod] = T[nod] + k;
            ++ k;    
        }
    }
}

int main()
{
    freopen("zvon.in", "rt", stdin);
    freopen("zvon.out", "wt", stdout);

    int i, a, b;

    for(scanf("%d", &Tt); Tt; --Tt)
    {
        for(scanf("%d", &N), i=1; i<N; ++i)
        {
            scanf("%d %d", &a, &b);
            V[a].push_back(b);
        }    

        df(1);

        T[1] = 0;
        bfs();

        int sol = 0;

        for(i=1; i<=N; ++i)
        {
            sol = T[i] > sol ? T[i] : sol;
            Nr[i] = 0;
            T[i] = 0;
            V[i].clear();
        }

        printf("%d\n", sol);
    }

    fclose(stdin);
    fclose(stdout);

    return 0;
}