use std::cmp::{max, 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 v = sc.read::<usize>() - 1;
        let u = sc.read::<usize>() - 1;
        graph[u].push(v);
        graph[v].push(u);
    }

    let dist0 = bfs(&graph, 0);
    let s = dist0
        .iter()
        .enumerate()
        .map(|(i, &dist)| (dist, i))
        .max()
        .unwrap()
        .1;
    let dist_s = bfs(&graph, s);
    let t = dist_s
        .iter()
        .enumerate()
        .map(|(i, &dist)| (dist, i))
        .max()
        .unwrap()
        .1;
    let mut on_path = vec![false; n];
    on_path[s] = true;
    on_path[t] = true;

    let mut q = VecDeque::new();
    q.push_back(t);
    while let Some(v) = q.pop_front() {
        for &prev in graph[v].iter() {
            if dist_s[prev] + 1 == dist_s[v] {
                q.push_back(prev);
                on_path[prev] = true;
            }
        }
    }

    let mut path_dist = vec![n; n];
    for i in 0..n {
        if on_path[i] {
            path_dist[i] = 0;
            q.push_back(i);
        }
    }
    while let Some(v) = q.pop_front() {
        for &next in graph[v].iter() {
            if path_dist[next] > path_dist[v] + 1 {
                path_dist[next] = path_dist[v] + 1;
                q.push_back(next);
            }
        }
    }

    if path_dist.into_iter().max().unwrap() > 1 {
        println!("-1");
        return;
    }

    let mut path = vec![];
    for i in 0..n {
        if on_path[i] {
            path.push((dist_s[i], i));
        }
    }

    path.sort();
    let path1 = path.iter().map(|t| t.1).collect::<Vec<_>>();

    let mut ans1 = vec![];
    for &v in path1.iter() {
        let s = ans1.len() + 1;
        let mut non_path = 0;
        for &next in graph[v].iter() {
            if !on_path[next] {
                non_path += 1;
            }
        }
        for _ in 0..non_path {
            let t = ans1.len() + 2;
            ans1.push(t);
        }
        ans1.push(s);
    }
    let mut ans2 = vec![];
    for &v in path1.iter().rev() {
        let s = ans2.len() + 1;
        let mut non_path = 0;
        for &next in graph[v].iter() {
            if !on_path[next] {
                non_path += 1;
            }
        }
        for _ in 0..non_path {
            let t = ans2.len() + 2;
            ans2.push(t);
        }
        ans2.push(s);
    }

    let ans = min(ans1, ans2);
    for i in 0..n {
        if i > 0 {
            print!(" ");
        }
        print!("{}", ans[i]);
    }
    println!();
}

fn bfs(graph: &Vec<Vec<usize>>, start: 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: 23160