/*
 * @Author: Bingbong 
 * @Date: 2024-11-15 14:50:27 
 * @Last Modified by: Bingbong
 * @Last Modified time: 2024-11-15 15:15:33
 */

#include<bits/stdc++.h>
#ifndef ONLINE_JUDGE
#include<bits/Bingbong.h>
#endif
using namespace std;
using i64=long long;
#define pi acos(-1)
void solve(){
    int n;
    cin>>n;
    vector<vector<int>>e(n+1);
    for(int i=1;i<n;i++){
        int u,v;
        cin>>u>>v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    vector<int>sz(n+1,1);
    vector<int>son(n+1);
    vector<int>fat(n+1);
    vector<vector<int>>ans(n+1);
    sz[0]=0;
    auto dfs=[&](auto &&self,int u,int fa)->void {
        fat[u]=fa;
        for(auto v:e[u]){
            if(v==fa) continue;
            self(self,v,u);
            sz[u]+=sz[v];
            if(sz[son[u]]<sz[v]){
                son[u]=v;
            }
        }
        if(son[u]==0){
            son[u]=u;
            ans[u].push_back(u);
            return ;
        }
        int now=son[u];
        //now=ans[son[u]][0];
        bool ok=false;
        while(sz[now]<=sz[u]-sz[now]){
            if(sz[now]==sz[u]-sz[now]){
                ans[u].push_back(now);
                ans[u].push_back(fat[now]);
                sort(ans[u].begin(),ans[u].end());
                ok=true;
                break;
            }
            now=fat[now];
        }
        if(!ok) ans[u].push_back(now);
    };

    dfs(dfs,1,0);
    for(int i=1;i<=n;i++){
        for(auto t:ans[i]) cout<<t<<" ";
        cout<<"\n";
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    while(t--) {
        solve();
    }
    return 0;
}