using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    static long[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => long.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var map = NMap(n - 1);
        var tree = new List<int>[n];
        for (var i = 0; i < n; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add(edge[1]);
            tree[edge[1]].Add(edge[0]);
        }
        var ans = new long[n];
        DFS(0, -1, tree, ans);
        WriteLine(string.Join("\n", ans));
    }
    static int DFS(int cur, int prev, List<int>[] tree, long[] ans)
    {
        var sum = 1;
        var count = 1;
        var list = new List<int>{ 1 };
        foreach (var next in tree[cur])
        {
            if (prev == next) continue;
            var ci = DFS(next, cur, tree, ans);
            list.Add(ci);
            sum += ci;
            count += ci;
        }
        foreach (var li in list) ans[cur] += (long)li * (sum - li);
        ++ans[cur];
        return count;
    }
}