#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T, class S, class U, class V> void writerLn(T x, S y, U z, V v) { writer(x, ' '); writer(y, ' '); writer(z, ' '); writer(v, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
ll mod_inv(ll a, ll m) { ll x, y; extgcd<ll>(a, m, x, y); return (m + x % m) % m; }

vector<int> e[ten(5)];
bool notLeaf[ten(5)];
vector<int> e2[ten(5)];

vector<int> checkE2(int n) {
	int zero = 0, one = 0, two = 0;
	int centers = 0;
	FOR(i, n) {
		if (notLeaf[i]) {
			centers++;
			if (sz(e2[i]) == 0) {
				zero++;
			} else if (sz(e2[i]) == 1) {
				one++;
			} else if(sz(e2[i]) == 2) {
				two++;
			} else {
				return {};
			}
		}
	}
	if (centers == 1) {
		FOR(i, n) if (notLeaf[i]) return { i };
		return {};
	}
	// centers >= 2;
	if (zero) return {};
	if (one != 2) return {};
	if (one + two != centers) return {};

	static bool used[ten(5)] = {};
	int start = -1;
	FOR(i, n) {
		if (notLeaf[i] && sz(e2[i]) == 1) {
			start = i;
			break;
		}
	}
	vector<int> ret = { start };
	used[start] = true;
	while (true) {
		int nt = -1;
		for (auto to : e2[start]) {
			if (used[to]) continue;
			nt = to;
			break;
		}
		if (nt == -1) break;

		start = nt;
		ret.push_back(nt);
		used[nt] = true;
	}

	return ret;
}

vector<int> build(vector<int> path, int n) {
	if (sz(path) == 1) {
		vector<int> ret;
		ret.push_back(1);
		FOR(i, n - 3) ret.push_back(3 + i);
		ret.push_back(2);
		ret.push_back(n);

		return ret;
	}

	const ll ext = ten(6);
	ll idxVal = ext * ext;
	vector<ll> ansSrc;
	FOR(i, sz(path)) {
		int cur = path[i];
		int others = sz(e[cur]) - 1;
		if (i != 0 && i != sz(path) - 1) others--;
		if (i == 0 && others != 0) {
			ansSrc.push_back(idxVal);
			idxVal -= ext;
			others--;
		}

		bool insertOne = false;
		if (i == sz(path) - 1 && others != 0) {
			insertOne = true;
			others--;
		}

		ansSrc.push_back(idxVal);
		FOR(j, others) ansSrc.push_back(idxVal + others - j);
		idxVal -= ext;

		if (insertOne) {
			ansSrc.push_back(idxVal);
			idxVal -= ext;
		}
	}
	reverse(ansSrc.begin(), ansSrc.end());

	vector<int> ans;
	{
		vector<ll> sorted = ansSrc;
		sort(sorted.begin(), sorted.end());
		FOR(i, n) {
			int id = lower_bound(sorted.begin(), sorted.end(), ansSrc[i]) - sorted.begin();
			ans.push_back(id + 1);
		}
	}

	return ans;
}

int main() {
	int n; reader(n);
	FOR(i, n - 1) {
		int a, b; reader(a, b);
		a--; b--;
		e[a].push_back(b);
		e[b].push_back(a);
	}
	if (n == 2) {
		puts("1 2");
		return 0;
	}

	FOR(i, n) if (sz(e[i]) != 1) notLeaf[i] = true;
	FOR(i, n) {
		if (notLeaf[i]) {
			for (auto to : e[i]) {
				if (notLeaf[to]) {
					e2[i].push_back(to);
				}
			}
		}
	}

	auto path = checkE2(n);
	if (sz(path) == 0) {
		puts("-1");
		return 0;
	}

	auto ans1 = build(path, n);
	reverse(path.begin(), path.end());
	auto ans2 = build(path, n);
	if (ans2 < ans1) ans1 = ans2;

	writerArr(ans1);

	return 0;
}

Measured memory_bytes: 15824