use std::cmp::min;
use std::collections::VecDeque;

fn main() {
    let (r, w) = (std::io::stdin(), std::io::stdout());
    let mut sc = IO::new(r.lock(), w.lock());

    let n: usize = sc.read();
    let mut graph = vec![vec![]; n];
    for _ in 1..n {
        let a = sc.read::<usize>() - 1;
        let b = sc.read::<usize>() - 1;
        graph[a].push(b);
        graph[b].push(a);
    }

    let dist0 = bfs(0, &graph);
    let (_, s1) = dist0
        .iter()
        .enumerate()
        .map(|(i, &d)| (d, i))
        .max()
        .unwrap();
    let dist1 = bfs(s1, &graph);
    let (_, s2) = dist1
        .iter()
        .enumerate()
        .map(|(i, &d)| (d, i))
        .max()
        .unwrap();

    let mut path = vec![false; n];
    let mut cur = s2;
    path[s2] = true;
    while cur != s1 {
        cur = *graph[cur]
            .iter()
            .find(|&&prev| dist1[prev] < dist1[cur])
            .unwrap();
        path[cur] = true;
    }

    for i in 0..n {
        if path[i] {
            continue;
        }
        if graph[i].iter().any(|&next| !path[next]) {
            println!("-1");
            return;
        }
    }

    let ans1 = solve(s1, &graph, &path);
    let ans2 = solve(s2, &graph, &path);

    let ans = min(ans1, ans2);
    for i in 0..n {
        if i > 0 {
            sc.write(" ");
        }
        sc.write(ans[i] + 1);
    }
    sc.write("\n");
}

fn solve(from: usize, graph: &Vec<Vec<usize>>, path: &Vec<bool>) -> Vec<usize> {
    let mut prev = from;
    let mut cur = graph[from][0];
    let mut ans = vec![0];
    loop {
        let x = ans.len();
        let leaves = graph[cur].iter().filter(|&&v| !path[v]).count();
        for i in 0..leaves {
            ans.push(x + i + 1);
        }
        ans.push(x);
        if let Some(&next) = graph[cur].iter().find(|&&v| path[v] && v != prev) {
            prev = cur;
            cur = next;
        } else {
            return ans;
        }
    }
}

fn bfs(start: usize, graph: &Vec<Vec<usize>>) -> Vec<usize> {
    let n = graph.len();
    let mut dist = vec![n; n];
    dist[start] = 0;
    let mut q = VecDeque::new();
    q.push_back(start);
    while let Some(v) = q.pop_front() {
        for &next in graph[v].iter() {
            if dist[next] > dist[v] + 1 {
                dist[next] = dist[v] + 1;
                q.push_back(next);
            }
        }
    }
    dist
}

pub struct IO<R, W: std::io::Write>(R, std::io::BufWriter<W>);

impl<R: std::io::Read, W: std::io::Write> IO<R, W> {
    pub fn new(r: R, w: W) -> Self {
        IO(r, std::io::BufWriter::new(w))
    }
    pub fn write<S: ToString>(&mut self, s: S) {
        use std::io::Write;
        self.1.write(s.to_string().as_bytes()).unwrap();
    }
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .0
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r' || b == b'\t')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r' && b != b'\t')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}


Measured memory_bytes: 19956