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

using ll = long long;

const int N = 100005;

int n, d[N], c[N], p[N], q, t;
vector<int> e[N], r, s;

void f(int x, int y){
    int u = int(e[x].size()) - d[x];
    if(d[x] == 1){
        if(!q){
            p[1] = q++;
            for(int i = t + 2; i <= t + u; i++) p[i] = q++;
            p[2] = q++;
            t += (u + 1); 
        }
        else{
            for(int i = t + 1; i < t + u; i++) p[i] = q++;
            p[t] = q++;
            p[n] = q++;
        }
    }
    else{
        for(int i = t + 1; i <= t + u; i++) p[i] = q++;
        p[t] = q++;
        t += (u + 1);
    }
    for(int i : e[x]) if(i != y && d[i]) f(i, x);
}

int main(){
    scanf("%d", &n);
    if(n == 1){ puts("1"); return 0; }
    for(int i = 0, x, y; i < n - 1; i++){
        scanf("%d%d", &x, &y);
        e[x].push_back(y);
        e[y].push_back(x);
    }
    
    for(int i = 1; i <= n; i++) c[i] = (e[i].size() > 1);
    for(int i = 1; i <= n; i++) for(int j : e[i]) if(c[i] && c[j]) d[i]++;
    if(count(d + 1, d + n + 1, 1) > 2){ puts("-1"); return 0; }
    
    if(count(d + 1, d + n + 1, 1) == 0){
        printf("1 ");
        for(int i = 3; i <= n - 1; i++) printf("%d ", i);
        printf("2 %d", n);
        return 0;
    }

    q = 0; t = 1;
    for(int i = 1; i <= n; i++) if(d[i] == 1){ f(i, 0); break; }
    r.resize(n);
    for(int i = 1; i <= n; i++) r[p[i]] = i;
    
    q = 0; t = 1;
    for(int i = n; i >= 1; i--) if(d[i] == 1){ f(i, 0); break; }
    s.resize(n);
    for(int i = 1; i <= n; i++) s[p[i]] = i;
    
    r = min(r, s);
    for(int i : r) printf("%d ", i);
    puts("");
}
