#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> P;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<ll,ll,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
vector<int> f(vector<int> v,int n){
    vector<int> ret;
    ret.push_back(n);
    int mi=n;
    rep(i,1,v.size()-1){
        int ne=mi-v[i]+1;
        ret.push_back(ne);
        rrep(j,mi-1,ne+1)ret.push_back(j);
        mi=ne;
    }
    ret.push_back(1);
    reverse(ret.begin(),ret.end());
    return ret;
}

int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int n;cin>>n;
    vector<int> v[n];
    rep(i,0,n-1){
        int a,b;cin>>a>>b;
        a--;
        b--;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    if(n==2){
        cout<<1<<" "<<2<<endl;
        return 0;
    }
    queue<int> q;
    bool used[n];
    int num=-1;
    fill(used,used+n,false);
    rep(i,0,n){
        if(v[i].size()>1){
            q.push(i);
            used[i]=true;
            num=i;
            break;
        }
    }
    vector<int> vv;
    while(q.size()>0){
        int now=q.front();q.pop();
        if(v[now].size()==1){
            vv.push_back(now);
            continue;
        }
        int cnt=0;
        rep(i,0,v[now].size()){
            int ne=v[now][i];
            if(used[ne])continue;
            if(v[ne].size()>1)cnt++;
        }
        if(now==num){
            if(cnt>=3){
                cout<<-1<<endl;
                return 0;
            }
            rep(i,0,v[now].size()){
                int ne=v[now][i];
                if(used[ne])continue;
                if(v[ne].size()>1){
                    q.push(ne);
                    used[ne]=true;
                }
            }
            if(cnt<=1){
                rep(i,0,v[now].size()){
                    if(used[v[now][i]]==false){
                        q.push(v[now][i]);
                        used[v[now][i]]=true;
                        break;
                    }
                }
            }
        }
        else{
            if(cnt>=2){
                cout<<-1<<endl;
                return 0;
            }
            rep(i,0,v[now].size()){
                int ne=v[now][i];
                if(used[ne])continue;
                if(v[ne].size()>1){
                    q.push(ne);
                    used[ne]=true;
                }
            }
            if(cnt<=0){
                rep(i,0,v[now].size()){
                    if(used[v[now][i]]==false){
                        q.push(v[now][i]);
                        used[v[now][i]]=true;
                        break;
                    }
                }
            }
        }
    }
    int s=vv[0],t=vv[1];
    int par[n];
    par[s]=-1;
    q.push(s);
    while(q.size()>0){
        int now=q.front();q.pop();
        rep(i,0,v[now].size()){
            int ne=v[now][i];
            if(ne==par[now])continue;
            par[ne]=now;
            q.push(ne);
        }
    }
    vector<int> path;
    for(;;){
        path.push_back(t);
        if(t==s)break;
        t=par[t];
    }
    vector<int> w;
    rep(i,0,path.size()){
        w.push_back(v[path[i]].size());
    }
    vector<int> v1=f(w,n);
    reverse(w.begin(),w.end());
    vector<int> v2=f(w,n);
    rep(i,0,v1.size()){
        if(v1[i]<v2[i]){
            rep(j,0,v1.size())cout<<v1[j]<<" ";
            cout<<endl;
            return 0;
        }
        else if(v2[i]<v1[i]){
            rep(j,0,v2.size())cout<<v2[j]<<" ";
            cout<<endl;
            return 0;
        }
    }
    rep(j,0,v1.size())cout<<v1[j]<<" ";
    cout<<endl;
    return 0;
}


Measured memory_bytes: 8696