fn dfs(cur: usize, prev: usize, paths: &Vec<Vec<usize>>, result: &mut Vec<usize>) -> usize {
    let mut children = 1usize;
    let mut cs = vec![1];
    for &v in paths[cur].iter() {
        if v == prev { continue; }
        let val = dfs(v, cur, paths, result);
        children += val;
        cs.push(val);
    }
    result[cur] = children * children - cs.iter().map(|&v| v * v).sum::<usize>() + 1;
    children
}

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut paths = vec![vec![]; n];
    for _ in 0..n-1 {
        let mut temp = String::new();
        std::io::stdin().read_line(&mut temp).ok();
        let temp: Vec<usize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        let u = temp[0]-1;
        let v = temp[1]-1;
        paths[u].push(v);
        paths[v].push(u);
    }

    let mut result = vec![0usize; n];
    dfs(0, 0, &paths, &mut result);
    for &v in result.iter() {
        println!("{}", v);
    }
}