//ts
#include <bits/stdc++.h>
//The quick brown fox jumps over the lazy dog//
using namespace std;
typedef long long ll;
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define ashar(x) setprecision(x)
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
#define TXT freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
int t, n;
int x, y;
int h[100010], sz[100010];
bool mark[100010];
vector<int> edge[100010];
void dfs(int v)
{
	mark[v] = 1;
	sz[v] = 1;
	for(int u: edge[v])
	{
		if(!mark[u])
		{
			h[u] = h[v] + 1;
			dfs(u);
			sz[v] += sz[u];
		}
	}
}
int main()
{
	fast_io
	cin >> t; 
	while(t--)
	{
		for(int i = 0; i < 100010; i++)
		{
			h[i] = 0; 
			sz[i] = 0;
			mark[i] = 0;
		}
		cin >> n;
		for(int i = 0; i < n - 1; i++)
		{
			cin >> x >> y;
			x--, y--;
			edge[x].pb(y);
			edge[y].pb(x);
		}
		dfs(0);
//		cout << t << endl;
//		for(int i = 0; i < n; i++)
//		{
//			cout << "edge " << i <<": ";
//			for(int j : edge[i])
//			{
//				cout << j << " ";
//			}
//			cout << endl;
//			cout << "h " << i <<" : "<< h[i] << " sz: " << sz[i];
//			cout << endl;
//		}
		for(int i = 0; i < n; i++)
		{
			int x = edge[i].size();
			for(int j = 0; j < x; j++)
			{
				edge[i].ppb();
			}
		}
		for(int i = 0; i < n; i++)
		{
			cout << h[i] + 1 << " " << n - sz[i] + 1 << endl;
		}
	}
	return 0;
}