#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

vii G, G2;

void dfs(int now, int par, int t, vi &num) {
  if (par != -1) {
    num.push_back(G[now].size());
  }
  if (now == t) return;
  rep (i, G2[now].size()) {
    int v = G2[now][i];
    if (v == par) continue;
    dfs(v, now, t, num);
  }

}

int main() {
  int n;
  cin >> n;
  G.resize(n);
  G2.resize(n);
  
  rep (i, n - 1) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  if (n == 2) {
    cout << 1 << " " << 2 << endl;
    return 0;
  }

  rep (i, n) {
    int cnt = 0;
    rep (j, G[i].size()) {
      int v = G[i][j];
      if (G[v].size() > 1) cnt++;
    }
    if (cnt > 2) {
      cout << -1 << endl;
      return 0;
    }
  }

  set<int> st;
  rep (i, n) {
    if (G[i].size() != 1) st.insert(i);
  }

  rep (i, n) {
    if (not st.count(i)) continue;
    rep (j, G[i].size()) {
      int v = G[i][j];
      if (not st.count(v)) continue;
      G2[i].push_back(v);
    }
  }

  int s = -1, t = -1;
  rep (i, n) {
    if (G2[i].size() == 1) {
      if (s == -1) s = t = i;
      else t = i;
    }
  }

  if (s == -1 and t == -1) {
    s = t = *st.begin();
  }

  rep (j, G[s].size()) {
    int v = G[s][j];
    if (G[v].size() == 1) {
      G2[s].push_back(v);
      G2[v].push_back(s);
      s = v;
      break;
    }
  }
  rep (j, G[t].size()) {
    int v = G[t][j];
    if (G[v].size() == 1 and v != s) {
      G2[t].push_back(v);
      G2[v].push_back(t);
      t = v;
      break;
    }
  }

  /*
  DEBUG_MAT(G);
  DEBUG_MAT(G2);
  DEBUG(s);
  DEBUG(t);
  //*/

  vi ans(n, inf);
  rep (_, 2) {
    vi num;
    dfs(s, -1, t, num);
    // DEBUG_VEC(num);
    vi a(n, -1);
    a[0] = 0;
    int j = 1;
    int cnt = 1;
    rep (i, num.size()) {
      a[max(j + num[i] - 2, j)] = cnt++;
      for (int k = j; k < j + num[i] - 2; k++) {
        a[k] = cnt++;
      }
      j = j + num[i] - 1;
    }
    ans = min(ans, a);
    swap(s, t);
  }

  rep (i, ans.size()) {
    cout << ans[i] + 1 << " ";
  }
  cout << endl;
}


Measured memory_bytes: 24952