//実装が重そうな問題はある程度考えてから書く
//初期化を忘れずに（特に二分探索とか）
//コーナーケースを考えて（特に場合分けとか）
//不可解すぎるバグは配列外参照（配列の長さ）を検討
#include <bits/stdc++.h>
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(),YES,NO))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b)  for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(a);i>=(LL)(b);i--)
#define REP(i,b) FOR(i,zero,b)
#define EREP(i,b) EFOR(i,zero,b)
#define RREP(i,b) RFOR(i,b,zero)
#define ALL(c) c.begin(),c.end()
#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB push_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a,b) OUT2(a,b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a,b) cout << (a) <<" "<<(b) << endl
#define int LL
#define zero 0LL
using namespace std;
template<typename T> inline void maximize(T &a,T b){a=max(a,b);}
template<typename T> inline void minimize(T &a,T b){a=min(a,b);}
template<typename T> inline bool middle(T a,T b,T c){return b<=a && a<=c;}
typedef long long LL;
typedef double ld;
typedef LL ut;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut,ut> pr;
typedef pair<ut,pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef priority_queue<pr,Vpr,greater<pr> > PQ;
inline void outputVI(VI x){REP(i,SI(x)){cout << three(i," ","") << x[i];}OUT("");}
const int SIZE1=5*1e5+1000;
const int SIZE2=5010;
const int SIZE3=400;
const int SIZE=SIZE1;
const LL p=7+1e9;
const LL INF=1LL<<60;
const long double EPS=1e-7;
string s;
ut N,M,K,X,L,Y;
// ut A,B,C,D,E,F,G,H,I,J,O,P,Q,R,T,U;
VI edges[SIZE];
LL vals[SIZE],nums[SIZE],maps[SIZE2][SIZE2],answer=zero;
bool reached[SIZE];
////////////////////////////////////////////////////////////////////////////////////////////
 
////////////////////////////////////////////////////////////////////////////////////////////
void init(){
 
}
VI ans;
int root;
void searchalf(int x){
	REP(i,SIZE) reached[i]=false;
	queue<int> qu;
	qu.push(x);
	reached[x]=true;
	while(!qu.empty()){
		int now=qu.front();
		qu.pop();
		REP(i,edges[now].size()){
			int next=edges[now][i];
			if(!reached[next]){
				reached[next]=true;
				qu.push(next);
				root=next;
			}
		}
	}
}
int nowN=2;
int nowQ=1;
inline bool isLeef(int x){
	return edges[x].size()==1;
}
void search(int now,int from){
	int maxim=0;
	REP(i,edges[now].size()){
		int next=edges[now][i];
		if(next==from) continue;
		if(isLeef(next)){

			ans.PB(nowN++);
		}
	}
	REP(i,edges[now].size()){
		int next=edges[now][i];
		if(next==from) continue;
		if(!isLeef(next)){
			ans.PB(nowQ);
			nowQ=nowN++;
			search(next,now);
			break;
		}
	}
	if(from==-1) ans.PB(nowQ);
}
LL solve(){
	int N;
	cin >> N;
	REP(i,N-1){
		int A,B;
		cin >> A >> B;
		edges[A].PB(B);
		edges[B].PB(A);
	}
	
	searchalf(1);
	search(root,-1);
	if(SI(ans)!=N) return 0;
	if(ans[N-1]<ans[N-2]) swap(ans[N-1],ans[N-2]);
	searchalf(root);
	VI ans2;
	REP(i,N) ans2.PB(ans[i]);
	ans.clear();
	nowQ=1;
	nowN=2;
	search(root,-1);

	if(ans[N-1]<ans[N-2]) swap(ans[N-1],ans[N-2]);
	if(ans2<ans)
		REP(i,N) ans[i]=ans2[i];	
	REP(i,SI(ans)){
		if(i) cout << " " << ans[i];
		else cout << ans[i];
	}
	cout << endl;
	return 1;
}
signed main(){
	if(solve()==0) cout << -1 << endl;
	return 0;
}


Measured memory_bytes: 27380