using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {

    class Info {
        public int Size { set; get; }
        public Dictionary<int, int> Removed { get; set; }
    }

    public void Run() {
        var n = ni();
        var c = ni(n);
        for (int i = 0; i < n; i++) {
            c[i]--;
        }
        var adj = Enumerable.Range(0, n).Select(_ => new List<int>()).ToArray();
        for (int i = 0; i < n - 1; i++) {
            var a = ni() - 1;
            var b = ni() - 1;
            adj[a].Add(b);
            adj[b].Add(a);
        }

        var ans = new long[n];

        Info Merge(Info x1, Info x2) {
            if (x1.Removed.Count < x2.Removed.Count) {
                (x1, x2) = (x2, x1);
            }

            x1.Size += x2.Size;

            foreach (var kv in x2.Removed) {
                x1.Removed.TryGetValue(kv.Key, out var value);
                x1.Removed[kv.Key] = kv.Value + value;
            }

            return x1;
        }

        Info dfs(int pos, int parent) {
            var info = new Info {
                Removed = new Dictionary<int, int>(),
                Size = 1,
            };
            foreach (var child in adj[pos]) {
                if (parent == child) continue;
                var sub = dfs(child, pos);

                var rem = sub.Size - (sub.Removed.TryGetValue(c[pos], out var value) ? value : 0);
                ans[c[pos]] += 1L * rem * (rem - 1) / 2 + rem;

                info = Merge(info, sub);
            }
            info.Removed[c[pos]] = info.Size; // remove
            return info;
        }

        var infoRoot = dfs(0, -1);

        for (int i = 0; i < n; i++) {
            var rem = infoRoot.Size - (infoRoot.Removed.TryGetValue(i, out var value) ? value : 0);
            ans[i] += 1L * rem * (rem - 1) / 2 + rem;
        }

        for (int i = 0; i < n; i++) {
            ans[i] = 1L * n * (n - 1) / 2 + n - ans[i];
        }

        cout.WriteLine(string.Join("\n", ans));
    }
}
// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}


Measured memory_bytes: 123600