#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const int N = 1e5+5;
vector<int>g[N];
int d[N] , vis[N] ,son[N];
int n;

void dfs(int u , int fa){
    vis[u] = 1;
    d[u] = d[fa] + 1; 
   // bool flag = 0;
    for(auto v : g[u]){
        if(vis[v]) continue;
        //flag = 1;
        dfs(v , u);
        son[u]+=(son[v]+1);
    }
    //if(!flag) d[u] = 1;
}

void solve(){
    for(int i = 0;i<=n+5;i++){
        d[i] = 0;
        vis[i] = 0;
        son[i] = 0;
        g[i].clear();
    }
    for(int i = 1 ; i <= n-1 ;i++){
        int u,v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
       // son[u]+=(son[v]+1);
    }
    dfs(1 , 0);
    for(int i = 1 ;i <= n;i++){
        cout << min(d[i] , n - son[i]) << " " << max(d[i] , n - son[i])  << "\n";
    }
}


int main(){
    int t = 1;
    cin >> t;
    while(t--){
        cin >> n;
        solve();
    }
    return 0;
}