#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod

struct edge{int to, cost;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G;
    vec dp;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
        dp.resize(N);
    }

    void add_Directed_edge(int from, int to, int cost = 1){
        G[from].push_back(edge({to, cost}));
    }

    void add_Undirected_edge(int v1, int v2, int cost = 1){
        add_Directed_edge(v1, v2, cost);
        add_Directed_edge(v2, v1, cost);
    }

    //calculate diameter of a Tree
    void dfs_for_calcdist(int v, int p, int c, vec &dist){
        if(p != -1) dist[v] = dist[p] + c;
        for(auto e: G[v]) if(e.to != p) dfs_for_calcdist(e.to, v, e.cost, dist);
    } 

    int diameter(int &v1, int &v2, int s = 0){
        vec dist(N, 0);
        dfs_for_calcdist(s, -1, -1, dist);
        v1 = distance(dist.begin(), max_element(dist.begin(), dist.end()));
        fill(dist.begin(), dist.end(), 0);
        dfs_for_calcdist(v1, -1, -1, dist);
        auto amax = max_element(dist.begin(), dist.end());
        v2 = distance(dist.begin(), amax);
        return *amax;
    }


    void calcsz(int v, int p = -1){
        dp[v] = 1;
        for(auto e: G[v]) if(e.to != p){
            calcsz(e.to, v);
            dp[v] += dp[e.to];
        }
    }

    bool dfs(int v, vec &ans, int &n, int p = -1){
        ans.pb(n++);
        vec v1, v2;
        for(auto e: G[v]) if(e.to != p){
            if(dp[e.to] == 1) v1.pb(e.to);
            else v2.pb(e.to);
        }
        if(SZ(v2) > 1) return false;
        else if(SZ(v2) == 1){
            REP(k, SZ(v1)){
                ans.pb(n++);
                swap(ans[SZ(ans) - 1], ans[SZ(ans) - 2]);
            }
            if(!dfs(v2[0], ans, n, v)) return false;
        }else if(SZ(v1) >= 1){
            REP(k, SZ(v1) - 1){
                ans.pb(n++);
                swap(ans[SZ(ans) - 1], ans[SZ(ans) - 2]);
            }
            ans.pb(n++);
        }
        return true;
    }

};


signed main(){

    int n; cin >> n;
    Graph G(n);
    int v, w;
    REP(i, n - 1){
        cin >> v >> w;
        G.add_Undirected_edge(v - 1, w - 1);
    }

    int r1, r2;
    bool f = false;
    vec ans1, ans2;
    G.diameter(r1, r2);
    //debug(r1); debug(r2);

    int k = 1;
    G.calcsz(r1);
    if(G.dfs(r1, ans1, k)) f = true;
    k = 1;
    G.calcsz(r2);
    if(G.dfs(r2, ans2, k)) f = true;
    if(f){
        bool u1 = true;
        REP(i, n){
            if(ans1[i] < ans2[i]){
                u1 = true;
                break;
            }
            if(ans1[i] > ans2[i]){
                u1 = false;
                break;
            }
        }
        if(u1){
            REP(i, n) cout << ans1[i] << " ";
        }else{
            REP(i, n) cout << ans2[i] << " ";
        }
        cout << endl;
    }else Out(-1);

    return 0;
}


Measured memory_bytes: 29160