#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()

const int N = (int)3e5;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
  else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  ret *= kaijo(n); ret %= MOD;
  ret *= gyaku_kaijo(r); ret %= MOD;
  ret *= gyaku_kaijo(n-r); ret %= MOD;
  return ret;
}

vector<vector<int>> G,T;

int main(void){
  ll n;cin>>n;
  rep(i,n){
    G.push_back(vector<int>());
    T.push_back(vector<int>());
  }

  rep(i,n-1){
    int v,w;
    cin>>v>>w;
    v--;w--;
    G[v].push_back(w);
    G[w].push_back(v);
  }

  if(n==2){
    cout<<1<<" "<<2<<endl;
    return 0;
  }

  int only = -1;
  rep(i,n){
    if(G[i].size() == 1) continue;
    only = i;
    rep(j,G[i].size()){
      int to = G[i][j];
      if(G[to].size() == 1) continue;
      T[i].push_back(to);
    }
  }

  vector<int> leaf;
  rep(i,n){
    if(T[i].size() == 1){
      leaf.push_back(i);
    }
  }
  cerr<<"leafsize:"<<leaf.size()<<endl;
  if(leaf.size() >= 3){
    cout<<-1<<endl;
    return 0;
  }
  if(leaf.size() == 0){
    leaf.push_back(only);
  }
  if(leaf.size() == 1){
    leaf.push_back(leaf[0]);
  }
  

  vector<int> ans[2];
  rep(i,2){
    int now = leaf[i];
    cerr<<"start:"<<now+1<<endl;
    vector<int> head,tail,checked;
    rep(j,n){
      checked.push_back(false);
    }
    checked[now] = true;
    head.push_back(1);
    int num = 2;
    while(true){
      //cerr<<now<<" noe"<<endl;
      checked[now] = true;
      int size = G[now].size();
      int memo = num;
      num++;
      rep(j,size-2){
        head.push_back(num);
        num++;
      }
      head.push_back(memo);
      if(now == leaf[(i+1)%2]){
        head.push_back(num);
        break;
      }
      else if(checked[T[now][0]]){
        now = T[now][1];
      }else{
        now = T[now][0];
      }
    }
    ans[i] = head;
    /*rep(j,n){
      cerr<<ans[i][j]<<" ";
    }
    cerr<<endl;*/
  }

  int ai=0;
  rep(i,ans[0].size()){
    if(ans[0][i] < ans[1][i]){
      ai = 0;
      break;
    }else if(ans[0][i] > ans[1][i]){
      ai = 1;
      break;
    }
  }
  rep(i,ans[0].size()){
    cout<<ans[ai][i]<<" ";
  }
  cout<<endl;


  return 0;
}


Measured memory_bytes: 13732