//Author:xht37
#include <bits/stdc++.h>

#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double

#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair

#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)

#define vi vector <int>
#define pb push_back
#define pq priority_queue

#define dbg(x) cerr << #x" = " << x << endl
#define debug(...) fprintf(stderr, __VA_ARGS__)

#define fl(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout)

using namespace std;

namespace io {
	const int SI = 1 << 21 | 1;
	char IB[SI], *IS, *IT, OB[SI], *OS = OB, *OT = OS + SI - 1, c, ch[100];
	int f, t;
	#define gc() (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin), IS == IT ? EOF : *IS++) : *IS++)
	inline void flush() {
		fwrite(OB, 1, OS - OB, stdout), OS = OB;
	}
	inline void pc(char x) {
		*OS++ = x;
		if (OS == OT) flush();
	}
	template <class I>
	inline void rd(I &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;
		for (x = 0; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + (c & 15), c = gc());
		x *= f;
	}
	template <class I>
	inline void rd(I &x, I &y) {
		rd(x), rd(y);
	}
	template <class I>
	inline void rd(I &x, I &y, I &z) {
		rd(x), rd(y), rd(z);
	}
	template <class I>
	inline void rda(I *a, int n) {
		for (int i = 1; i <= n; i++) rd(a[i]);
	}
	inline void rdc(char &c) {
		for (c = gc(); c < 33 || c > 126; c = gc());
	}
	inline void rds(char *s, int &x) {
		for (c = gc(); c < 33 || c > 126; c = gc());
		for (x = 0; c >= 33 && c <= 126; s[++x] = c, c = gc());
		s[x+1] = '\0';
	}
	template <class I>
	inline void print(I x, char k = '\n') {
		if (!x) pc('0');
		if (x < 0) pc('-'), x = -x;
		while (x) ch[++t] = x % 10 + '0', x /= 10;
		while (t) pc(ch[t--]);
		pc(k);
	}
	template <class I>
	inline void print(I x, I y) {
		print(x, ' '), print(y);
	}
	template <class I>
	inline void print(I x, I y, I z) {
		print(x, ' '), print(y, ' '), print(z);
	}
	inline void printc(char c) {
		pc(c);
	}
	inline void prints(string s) {
		int x = s.length();
		while (t < x) pc(s[t++]);
		pc('\n'), t = 0;
	}
	struct Flush {
		~Flush() {
			flush();
		}
	} flusher;
}
using io::rd;
using io::rda;
using io::rdc;
using io::rds;
using io::print;
using io::printc;
using io::prints;

const int N = 1e5 + 7;
int n, d[N], c[N], l, r;
vi e[N];
bool v[N];

inline int find(int x) {
	for (int y : e[x])
		if (!v[y] && d[y] != 1) return y;
	return 0;
}

inline vi work(int l, int r) {
	vi ret(1, 1), p(1, d[l] - 2);
	for (int i = 1; i <= n; i++) v[i] = 0;
	while (l != r) v[l] = 1, l = find(l), p.pb(d[l] - 2);
	int t = 1;
	for (int x : p) {
		dbg(x);
		for (int i = 1; i <= x; i++) ret.pb(t + i + 1);
		ret.pb(t + 1), t += x + 1;
	}
	ret.pb(n);
	return ret;
}

int main() {
	rd(n);
	if (n == 2) return prints("1 2"), 0;
	for (int i = 1, x, y; i < n; i++)
		rd(x, y), e[x].pb(y), e[y].pb(x), ++d[x], ++d[y];
	for (int i = 1; i <= n; i++) c[i] = d[i];
	for (int i = 1; i <= n; i++)
		if (d[i] == 1) --c[e[i][0]], --c[i];
	if (*max_element(c + 1, c + n + 1) > 2) return print(-1), 0;
	if (!*max_element(c + 1, c + n + 1)) {
		print(1, ' ');
		for (int i = 3; i < n; i++) print(i, ' ');
		print(2, ' '), print(n);
		return 0;
	}
	for (int i = 1; i <= n; i++)
		if (c[i] == 1) r = i;
	for (int i = n; i; i--)
		if (c[i] == 1) l = i;
	vi ans = min(work(l, r), work(r, l));
	for (int x : ans) print(x, ' ');
	return 0;
}

Measured memory_bytes: 11512