#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 200000 + 5;

int N;
struct Edge{
    int y, prev;
}e[MAX_N << 1];
int elast[MAX_N], ecnt;
int fa[MAX_N], sz[MAX_N], ms[MAX_N];
vector <int> ans[MAX_N];
char vis[MAX_N];

void Build(int x, int y) {
    ecnt ++;
    e[ecnt].y = y;
    e[ecnt].prev = elast[x];
    elast[x] = ecnt;
}

void dfs(int u, int fath) {
    sz[u] = 1;
    ms[u] = 0;
    fa[u] = fath;
    for (int i = elast[u]; i; i = e[i].prev) {
        int v = e[i].y;
        if (v != fath) {
            dfs(v, u);
            sz[u] += sz[v];
            ms[u] = max(ms[u], sz[v]);
        }
    }
    for (int i = elast[u]; i; i = e[i].prev) {
        int v = e[i].y;
        if (v == fath) continue;
        for (auto x : ans[v]) {
            while (x != u && !vis[fa[x]] && max(ms[x], sz[u] - sz[x]) > sz[u] / 2) {
                vis[x = fa[x]] = 1;
            }
            if (max(ms[x], sz[u] - sz[x]) <= sz[u] / 2) {
                ans[u].emplace_back(x);
                if (!vis[fa[x]] && max(ms[fa[x]], sz[u] - sz[fa[x]]) <= sz[u] / 2) {
                    vis[fa[x]] = 1;
                    ans[u].emplace_back(fa[x]);
                }
            }
        }
    }
    if (ans[u].empty()) {
        vis[u] = 1;
        ans[u].emplace_back(u);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    cin >> N;
    for (int i = 1; i < N; i ++) {
        int x, y;
        cin >> x >> y;
        Build(x, y); Build(y, x);
    }
    dfs(1, 0);
    for (int i = 1; i <= N; i ++) {
        assert((int)ans[i].size() <= 2);
        sort(ans[i].begin(), ans[i].end());
        for (int j = 0; j < (int)ans[i].size(); j ++) {
            if (j) cout << ' ';
            cout << ans[i][j];
        }
        cout << '\n';
    }
    
    return 0;
}