// author : thembululquaUwU
// 3.9.2024

#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define endl '\n'

using namespace std;
using ll = long long;
using ii = pair <int, int>;
using vi = vector <int>;

const int N = 2e5 + 5;
const int mod = 1e9 + 7;

void maxl(auto &a, auto b) {a = max(a, b);}
void minl(auto &a, auto b) {a = min(a, b);}

int n, sz[N], cen[N], par[N];
vector <int> adj[N];
pair <int, int> ans[N];

void dfs(int u, int p){
    sz[u] = 1; par[u] = p;
    pair <int, int> Max = {1, u};
    for (int v : adj[u]) if (v != p){
        dfs(v, u);
        sz[u] += sz[v];
        Max = max(Max, {sz[v], cen[v]});
    }

    cen[u] = Max.se;
    while (sz[cen[u]] * 2 < sz[u]) cen[u] = par[cen[u]];
    ans[u].fi = cen[u];
    if (sz[cen[u]] * 2 == sz[u]) ans[u].se = par[cen[u]];
}

void solve(){
    cin >> n;
    for (int i = 1, u, v; i < n; ++ i){
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    dfs(1, 0);
    for (int i = 1; i <= n; ++ i){
        cout << ans[i].fi << ' ';
        if (ans[i].se) cout << ans[i].se;
        cout << endl;
    }
}

int main(){
    if (fopen("pqh.inp", "r")){
        freopen("pqh.inp", "r", stdin);
        freopen("pqh.out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int t = 1; // cin >> t;
    while (t --) solve();
    return 0;
}