#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//using i128 = __int128_t;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}
inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}
inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}
inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
inline void print() {cout << "\n";}
template<class T>
inline void print(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";
    print();
}
template<class T, class... Args>
inline void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
#define dump(x)  cerr << #x << " = " << (x) << endl;
inline void debug() {cerr << endl;}
template<class T>
inline void debug(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";
    debug();
}
template<class T, class... Args>
inline void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
#else
#define dump(x)
inline void debug() {}
template<class T> inline void debug(const vector<T> &v) {}
template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}
#endif
struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    int N; cin >> N;
    vector<vector<int>> G(N);
    rep(i,N-1) {
        int u,v; cin >> u >> v;
        --u; --v;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }

    if (N==2) {
        print(1,2);
        return 0;
    }

    vector<int> leaf(N),hashi;
    rep(i,N) if ((int)G[i].size()==1) leaf[i] = 1;
    rep(i,N) {
        if (leaf[i]) continue;
        int cnt = 0;
        for (auto j : G[i]) if (!leaf[j]) cnt++;
        if (cnt > 2) {
            print(-1);
            return 0;
        }
        if (cnt<=1) hashi.emplace_back(i);
    }

    auto solve=[&](int v) {
        vector<int> ret(N);
        int cur = 0, num = 1, pv = -1;
        while (true) {
            int cnt = 0;
            int nv = -1;
            for (auto u : G[v]) {
                if (u==pv) continue;
                if (leaf[u]) cnt++;
                else nv = u;
            }
            if (nv!=-1) {
                ret[cur+cnt] = num;
                rep(i,cnt) {
                    ret[cur+i] = num+i+1;
                }
                cur += cnt+1;
                num = cur+1;
            } else {
                ret[N-1] = N;
                ret[N-2] = num;
                rep(i,cnt-1) {
                    ret[cur+i] = num+1+i;
                }
                return ret;
            }
            pv = v;       
            v = nv;
        }
        return ret;
    };

    vector<int> ans1,ans2;
    for (auto i : G[hashi[0]]) {
        if (leaf[i]) {
            ans1 = solve(i);
            break;
        } 
    }
    for (auto i : G[hashi.back()]) {
        if (leaf[i]) {
            ans2 = solve(i);
            break;
        }
    }

    rep(i,N) {
        if (ans1[i] < ans2[i]) {
            print(ans1);
            return 0;
        } else if (ans1[i] > ans2[i]) {
            print(ans2);
            return 0;
        }
    }

    print(ans1);
}

Measured memory_bytes: 10296