#include<bits/stdc++.h>
using namespace std;
vector<int>a[100005];
int vis[100005];
int sz[100005];
int dep[100005];
void dfs(int x,int deep) {
	vis[x] = 1;
	sz[x] = 1;
	dep[x] = deep;
	for(int i = 0;i<a[x].size();i++) {
		int to= a[x][i];
		if(vis[to] == 0)
		dfs(to,deep + 1);
		sz[x]+= sz[to];
	}
} 
int main() {
	int n;
	int maxnnn,maxnn=0,maxnnnn;
	cin >> n;
	for(int i = 0;i<n;i++) {
		int x;
		cin >> x;
		maxnn = max(maxnn,x);
		for(int j = 0;j<maxnn;j++) {
			a[j].clear();
			vis[j] = 0;
		}
		for(int j = 1;j<x;j++) {
			int aa,bb;
			cin >> aa >> bb;
			a[aa].push_back(bb);
			a[bb].push_back(aa);
		}
		dfs(1,1);
		for(int j = 1;j<=n;j++) {
			cout << dep[j] << " " << n-sz[i]+1 << endl;
		}
	}
	return 0;
}

（-22是神马玩意啊……） 求调………………