#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

pair<long long, int> dfs_diameter_of_tree(vector<vector<int> > &G, int pos, int last, long long d){
  pair<long long, int> ret = make_pair( d, pos );
  
  if(G[pos].size() == 1 && G[pos][0] == last){
    return ret;
  }

  for(int i=0; i<G[pos].size(); i++){
    if(G[pos][i] == last) continue;
    auto tmp = dfs_diameter_of_tree(G, G[pos][i], pos, d + 1);
    ret = max( ret, tmp );
  }
  return ret;
}

pair<int,int> diameter_of_tree(vector<vector<int> > &G){
  //{farthest dist, farthest point}
  pair<long long, int> d1 = dfs_diameter_of_tree(G, 0, -1, 0);
  pair<long long, int> d2 = dfs_diameter_of_tree(G, d1.second, -1, 0);
  return {d1.second, d2.second};
}

bool get_path(vector<vector<int>>& G, vector<int>& res, int pos, int last, int goal){
  if( pos == goal ){
    res.push_back( pos );
    return true;
  }

  for(auto nx : G[pos]){
    if(nx == last) continue;
    auto tmp = get_path(G, res, nx, pos, goal);
    if( tmp ){
      res.push_back( pos );
      return true;
    }
  }

  return false;
}

int main(){
  int n;
  cin >> n;

  vector<vector<int>> g(n);
  for(int i=0; i<n-1; i++){
    int v,w;
    cin >> v,w;
    v--; w--;
    g[v].push_back( w );
    g[w].push_back( v );
  }

  auto f = diameter_of_tree(g);

  vector<int> path;
  get_path(g, path, f.first, -1, f.second);

  vector<bool> is_path(n, false);
  for(int v : path){
    is_path[v] = true;
  }

  bool ok = true;
  for(int i : range(n)){
    if( is_path[i] ) continue;
    if( g[i].size() >= 2 ){
      ok = false;
    }
  }

  if(!ok){
    println(-1);
    return 0;
  }


  auto get_ans = [&](){
    vector<int> ans;

    int i = 0;
    for(int v : path){
      if( g[v].size() <= 2 ){
        ans.push_back(i);
        i++;
      }else{
        int j = i+1;
        for(auto nx : g[v]){
          if( is_path[nx] ) continue;
          ans.push_back(j);
          j++;
        }
        ans.push_back(i);
        i = j;
      }
    }

    assert(ans.size() == n);

    return ans;
  };

  auto a1 = get_ans();
  reverse(path.begin(), path.end());
  auto a2 = get_ans();

  if( a1 > a2 ) a1 = a2;

  for(auto& i : a1) i++;

  println(a1);

  return 0;
}


Measured memory_bytes: 17016