#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64

#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;

vector<int>G[100010];
int N;
int sz[100010];
int calc_size(int n, int pre) {
	int res = 1;
	for (auto nxt : G[n]) {
		if (nxt != pre)res += calc_size(nxt, n);
	}
	return sz[n] = res;
}
bool is_cat(int n,int pre) {
	int cnt = 0;
	for (auto nxt : G[n]){
		if (nxt != pre)if (!is_cat(nxt, n))return false;
		if (sz[nxt] >= 2)cnt++;
	}
	if (cnt >= 3)return false;
	else return true;
}
void dfs(int s, int n, int pre, int &t, int &mx, int res) {
	if (res > mx) {
		mx = res;
		t = n;
	}
	for (auto nxt : G[n])if (nxt != pre) {
		dfs(s, nxt, n, t, mx, res + 1);
	}
}
int nx[100010];
bool is_next(int n, int pre,int t) {
	if (n == t)return true;
	for (auto nxt : G[n])if (nxt != pre) {
		if (is_next(nxt, n, t)) {
			nx[n] = nxt;
			return true;
		}
	}
	return false;
}
int deg[100010];
bool done[100010];
vector<int>mk(int s, int t) {
	is_next(s, s, t);
	vector<int>v;
	int now = s;
	while (true) {
		for (auto nxt : G[now])done[nxt] = true;
		now = nx[now];
		if (now == t)break;
	}
	REP(i, N) {
		if (!done[i]) {
			print(-1); exit(0);
		}
	}
	while (true) {
		v.push_back(deg[s]);
		s = nx[s];
		if (s == t)break;
	}
	//print_space(v);
	int idx = 1;
	vector<int>ans;
	ans.push_back(idx);
	idx++;
	FOR(i, 1, v.size()) {
		int c = v[i] - 2;
		if (c) {
			int tmp = idx++;
			REP(_, c) {
				ans.push_back(idx);
				idx++;
			}
			ans.push_back(tmp);
		}
		else ans.push_back(idx++);
	}
	ans.push_back(idx++);
	return ans;
}

void solve() {
	cin >> N;
	REP(i, N - 1) {
		int u, v; cin >> u >> v;
		u--, v--;
		G[u].push_back(v);
		G[v].push_back(u);
		deg[u]++;
		deg[v]++;
	}
	calc_size(0, 0);
	//REP(i, N)print(sz[i]);
	//if (!is_cat(0, 0)) {
	//	print(-1); return;
	//}
	int s = 0, t = 0;
	int l = 0;
	dfs(s, s, s, t, l, 0);
	l = 0;
	dfs(t, t, t, s, l, 0);

	vector<int>ans1 = mk(s, t), ans2 = mk(t, s);
	if (ans1 < ans2)print_space(ans1);
	else print_space(ans2);
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	//int q;
	//cin >> q;
	//while (q--)
	solve();

}


Measured memory_bytes: 23792