#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

#define MAX(a,b) (((a)>(b))?(a):(b))
#define NMAX 100001
#define pb push_back
#define mp make_pair
#define f first
#define s second

int N, Case;
int V[NMAX], G[NMAX];
char Viz[NMAX];
vector<int> A[NMAX];
vector<pair<int,int> > X;

void dfs(int i)
{
        int j, k, poz, max, m = G[i], f;

        for (j = 0; j < m; j++) dfs(A[i][j]);
        
        for (j = 0; j < m; j++) Viz[A[i][j]] = '0';

        X.clear();
        for (k = 0; k < m; k++) {
               f = A[i][k];
               X.pb(mp(-V[f],f)); }

        sort(X.begin(), X.end());

        for (j = 0, V[i] = 0; j < m; j++)
        {
              max = -X[j].f; poz = X[j].s;

              V[i] = MAX(V[i],max+j+1);
              Viz[poz] = '1';
        }
}

int main()
{
        int i, j, k;

        freopen("zvon.in", "r", stdin);
        freopen("zvon.out", "w", stdout);

        scanf("%d", &Case);
        while (Case--)
        {
              scanf("%d", &N);
              for (k = 1; k < N; k++)
              {
                  scanf("%d%d", &i, &j);
                  A[i].push_back(j); G[i]++;
              }
              dfs(1);
              printf("%d\n", V[1]);
              for (i = 0; i <= N; i++)
              {
                      A[i].clear();
                      V[i] = ' '; Viz[i] = G[i] = 0;
              }

        }
      
        return 0;
         
}