#include <bits/stdc++.h>
using namespace std;

#define int long long
#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 all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end()))
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int DX[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

signed main() {
    int n;
    cin >> n;
    vint v(n - 1), w(n - 1);
    vvint adj(n);
    vint deg(n), cdeg(n);
    rep(i, n - 1) {
        cin >> v[i] >> w[i];
        v[i]--, w[i]--;
        adj[v[i]].push_back(w[i]);
        adj[w[i]].push_back(v[i]);
        deg[v[i]]++, deg[w[i]]++;
        cdeg[v[i]]++, cdeg[w[i]]++;
    }
    rep(i, n) {
        if (deg[i] == 1) {
            cdeg[i] = 0;
            cdeg[adj[i][0]]--;
        }
    }
    int s = -1;
    rep(i, n) {
        if (cdeg[i] > 2) { fin(-1); }
        if (cdeg[i] == 1) { s = i; }
    }
    if (n == 2) { fin("1 2"); }
    vint p;
    if (s == -1) { p.push_back(n - 2); }
    else {
        vector<bool> used(n);
        while (true) {
            p.push_back(deg[s] - 1);
            used[s] = true;
            int nxt = -1;
            rep(i, adj[s].size()) {
                if (!used[adj[s][i]] && cdeg[adj[s][i]] != 0) { nxt = adj[s][i]; }
            }
            if (nxt == -1) { break; }
            s = nxt;
        }
    }
    p.insert(p.begin(), 1);
    p.push_back(1);
    auto f = [](vint x) {
        vint ret;
        int sum = 1;
        rep(i, x.size()) {
            reps(j, x[i] - 1) { ret.push_back(sum + j); }
            ret.push_back(sum);
            sum += x[i];
        }
        return ret;
    };
    vint a0 = f(p);
    reverse(all(p));
    vint a1 = f(p);
    vint ans = min(a0, a1);
    rep(i, n) { cout << ans[i] << " "; }
    cout << endl;

}

Measured memory_bytes: 13300