#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    vector<vector<int> > g(n + 1);
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    vector<int> mx(n + 1), sz(n + 1), fa(n + 1), son(n + 1);
    vector<vector<int> > ans(n + 1);

    auto dfs = [&](auto &&dfs, int u) -> void {
        sz[u] = 1;
        int heavy = 0;
        for(auto j : g[u]){
            if (j == fa[u]) continue;
            fa[j] = u;
            dfs(dfs, j);
            sz[u] += sz[j];
            if (sz[j] > sz[heavy]) heavy = j;
        }
        son[u] = heavy;
        mx[u] = sz[heavy];
        if (mx[u] * 2 <= sz[u]){
            ans[u].push_back(u);
            if (mx[u] * 2 == sz[u]){
                ans[u].push_back(son[u]);
            }            
        }
        else{
            int t = ans[heavy][0];
            while((sz[u] - sz[t]) * 2 > sz[u]) t = fa[t];
            ans[u].push_back(t);
            if ((sz[u] - sz[t]) * 2 == sz[u]) ans[u].push_back(fa[t]);
            else if (sz[son[t]] * 2 == sz[u]) ans[u].push_back(son[t]);
        }
        sort(ans[u].begin(), ans[u].end());
    };

    dfs(dfs, 1);
    for(int i = 1; i <= n; i++){
        for(auto x : ans[i]) cout << x << ' ';
        cout << '\n';
    }

}