#include<bits/stdc++.h>
using namespace std;
long long c,n,x,y,ss[100010],step[100010];
vector<int>G[100010];
void dfs(int i,int fa){
	ss[i]=1;
	step[i]=step[fa]+1;
	for(auto j:G[i]){
		if(j==fa)continue;
		dfs(j,i);
		ss[i]+=ss[j];
	}
} 
int main(){
	scanf("%d",c);
	while(c--){
		scanf("%d",&n);
		for(int i=1;i<=n;++i)G[i].clear();
		for(int i=1;i<n;++i){
			scanf("%d%d",&x,&y);
			G[x].push_back(y);
			G[y].push_back(x); 
		}
		dfs(1,0);
		for(int i=1;i<=n;++i)printf("%d %d\n",step[i],n-ss[i]+1);
	}
	return 0;
}