//by 72
#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)
#define Fd(i, a, b) for(int i = a; i >= b; i --)
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
using namespace std;

const int mod = 998244353;
const int N = 2e5 + 10;
const int inf = 1e18;
typedef array<int, 3> a3; 
typedef long long ll;

int n, m, fa[N], now[N], sz[N], mx[N], res[N];
vector<int> ed[N];

void dfs(int u, int f) {
    now[u] = u, sz[u] = 1;
    for(auto v : ed[u]) {
        if(v == f) continue;
        res[u] = 0;
        fa[v] = u;
        dfs(v, u);
        sz[u] += sz[v];
        mx[u] = max(mx[u], sz[v]);
        auto cal = [&](int &x) -> int {
            return max(mx[x], sz[u] - sz[x]);
        };
        auto work = [&](int &x) -> void {
            while(x != u && cal(fa[x]) < cal(x)) x = fa[x]; 
        };
        int x1 = now[u], x2 = now[v];
        work(x1), work(x2);
        if(cal(x1) < cal(x2)) {
            if(x1 != u && cal(x1) == cal(fa[x1])) res[u] = 1;
            now[u] = x1;
        } else {
            if(x2 != u && cal(x2) == cal(fa[x2])) res[u] = 1;
            now[u] = x2;
        }
        // cout << u << " " << v << " " << now[u] << " " << res[u] << "??\n";
    }
}

void sol() {
    cin >> n;
    F(i, 1, n - 1) {
        int u, v; cin >> u >> v;
        ed[u].push_back(v), ed[v].push_back(u);
    }
    dfs(1, 1);
    F(i, 1, n) {
        if(res[i]) cout << min(now[i], fa[now[i]]) << " " << max(fa[now[i]], now[i]) << "\n";
        else cout << now[i] << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    // cin >> t;
    F(i, 1, t) sol();
    return 0;
}
//sldl