#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

const int N = 100000;

int n;
int d[N];
vector<int> v[N];

inline int max ( int a, int b ) { return (a > b) ? a : b; }

void df ( int k ) {
	vector<int> t;
	for (int i = 0; i < v[k].size(); ++i) {
		df(v[k][i]);
		t.push_back(d[i]);
	}
	sort(t.begin(),t.end());
	if (t.size()>0) {
		d[k] = 0;
		for (int i = 0; i < t.size(); ++i) {
			d[k] = max(d[k],t[i]+t.size()-i);
		}
	}
}

int main() {
	freopen("zvon.in","rt",stdin);
	freopen("zvon.out","wt",stdout);
	int t;
	for (scanf("%d",&t); t > 0; --t) {
		scanf("%d",&n);
		for (int i = 0; i<N; ++i) v[i].clear();
		for (int i = 0; i < n-1; ++i) {
			int a,b;
			scanf("%d %d",&a,&b);
			--a; --b;
			v[a].push_back(b);
		}
		df(0);
		printf("%d\n",d[0]);
	}
	return 0;
}