#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define S second
#define F first
int n;
vector<vector<int>> adj;
vector<int> sz;
vector<vector<int>> heavy;
void findsz(int v, int last){
    for(auto u : adj[v]){
        if(u == last) continue;
        findsz(u, v);
        sz[v] += sz[u];
    }
}


void dfs(int v, int last, vector<int> &path){
      path.push_back(v);
      int hund = -1;
      for(auto u : adj[v]){
           if(u == last) continue;
           if(sz[u] * 2 >= sz[v]) hund = u;
      }
      if(hund == -1){
          heavy.push_back(path);
      }
      for(auto u : adj[v]){
          if(u == last) continue;
          if(u == hund){
                dfs(u, v, path);
          } else {
                vector<int> nw;
                dfs(u, v, nw);
          }
      }
}

void init(){
	 cin >> n;
	 int u, v;
	 adj.assign(n + 1, vector<int>());
	 sz.assign(n + 1, 1);
	 for(int i = 0; i < n - 1; i++){
         cin >> u >> v;
         adj[u].pb(v);
         adj[v].pb(u);
	 }
	 findsz(1, 1);
	 vector<int> initv;
     dfs(1, 1, initv);
}
int32_t main(){
     ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
     init();
     vector<int> ans[n + 5];
     for(auto &path : heavy){
          for(int i = 0; i < path.size(); i++){
               int l = i, r = path.size();
               int N = sz[path[i]];
               while(l + 1 < r){
                   int mid = (l + r)/2;
                   if(sz[path[mid]] * 2 >= N) l = mid;
                   else r = mid;
               }
               if(sz[path[l]] * 2 == N) ans[path[i]].push_back(path[l - 1]);
               ans[path[i]].push_back(path[l]);
          }
     }


     for(int i = 1; i <= n; i++){
          sort(ans[i].begin(), ans[i].end());
          for(auto hariu : ans[i]) cout << hariu << " ";
          cout << '\n';
     }

}