Problem:
Score : 600 points

Problem Statement

We have a tree with N vertices numbered 1 to N. The i-th edge in this tree connects Vertex a_i and b_i.
Additionally, each vertex is painted in a color, and the color of Vertex i is c_i. Here, the color of each vertex is represented by an integer between 1 and N (inclusive). The same integer corresponds to the same color; different integers correspond to different colors.

For each k=1, 2, ..., N, solve the following problem:

Find the number of simple paths that visit a vertex painted in the color k one or more times.

Note: The simple paths from Vertex u to v and from v to u are not distinguished.

Constraints

1 \leq N \leq 2 \times 10^5

1 \leq c_i \leq N

1 \leq a_i,b_i \leq N

The given graph is a tree.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
c_1 c_2 ... c_N
a_1 b_1
:
a_{N-1} b_{N-1}

Output

Print the answers for k = 1, 2, ..., N in order, each in its own line.

Sample Input 1

3
1 2 1
1 2
2 3

Sample Output 1

5
4
0

Let P_{i,j} denote the simple path connecting Vertex i and j.

There are 5 simple paths that visit a vertex painted in the color 1 one or more times:

P_{1,1}\,,\,
P_{1,2}\,,\,
P_{1,3}\,,\,
P_{2,3}\,,\,
P_{3,3}

There are 4 simple paths that visit a vertex painted in the color 2 one or more times:

P_{1,2}\,,\,
P_{1,3}\,,\,
P_{2,2}\,,\,
P_{2,3}

There are no simple paths that visit a vertex painted in the color 3 one or more times.

Sample Input 2

1
1

Sample Output 2

1

Sample Input 3

2
1 2
1 2

Sample Output 3

2
2

Sample Input 4

5
1 2 3 4 5
1 2
2 3
3 4
3 5

Sample Output 4

5
8
10
5
5

Sample Input 5

8
2 7 2 5 4 1 7 5
3 1
1 2
2 7
4 5
5 6
6 8
7 8

Sample Output 5

18
15
0
14
23
0
23
0

Solution in Rust (1.42.0) (judge verdict: Time Limit Exceeded)

// This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
use competitive::prelude::*;

fn main() {
    input! {
        n: usize,
        c: [Usize1; n],
        es: [(Usize1, Usize1); n - 1],
    }

    let mut g = vec![vec![]; n];

    for (u, v) in es {
        g[u].push(v);
        g[v].push(u);
    }

    let mut grp = vec![vec![]; n];

    for i in 0..n {
        grp[i].push(n);
    }

    let mut grpi = vec![0; n];

    let _ = subtree_size(0, None, &g);
    for i in 0..n {
        dbg!(i, subtree_size(i, None, &g));
    }
    solve(0, None, &c, &g, &mut grp, &mut grpi);

    dbg!(&grp);

    for i in 0..n {
        let mut ans = n * (n + 1) / 2;

        for &g in grp[i].iter() {
            ans -= g * (g + 1) / 2;
        }

        echo!(ans);
    }
}

#[memoise(cur)]
fn subtree_size(cur: usize, prev: Option<usize>, g: &Vec<Vec<usize>>) -> usize {
    let mut ret = 1;
    for &next in g[cur].iter() {
        if Some(next) == prev {
            continue;
        }
        ret += subtree_size(next, Some(cur), g);
    }
    ret
}

fn solve(
    cur: usize,
    prev: Option<usize>,
    c: &Vec<usize>,
    g: &Vec<Vec<usize>>,
    grp: &mut Vec<Vec<usize>>,
    grpi: &mut Vec<usize>,
) {
    let col = c[cur];
    let ci = grpi[col];
    grp[col][ci] -= 1;

    for &next in g[cur].iter() {
        if Some(next) == prev {
            continue;
        }

        let t = subtree_size(next, Some(cur), g);
        grp[col][ci] -= t;
        grp[col].push(t);
        grpi[col] = grp[col].len() - 1;
        solve(next, Some(cur), c, g, grp, grpi);
        grpi[col] = ci;
    }
}
*/

fn main() {
    let exe = "/tmp/bin0E5DD53F";
    std::io::Write::write_all(&mut std::fs::File::create(exe).unwrap(), &decode(BIN)).unwrap();
    std::fs::set_permissions(exe, std::os::unix::fs::PermissionsExt::from_mode(0o755)).unwrap();
    std::process::exit(std::process::Command::new(exe).status().unwrap().code().unwrap())
}

fn decode(v: &str) -> Vec<u8> {
    let mut ret = vec![];
    let mut buf = 0;
    let mut tbl = vec![64; 256];
    for i in 0..64 { tbl[TBL[i] as usize] = i as u8; }
    for (i, c) in v.bytes().filter_map(|c| { let c = tbl[c as usize]; if c < 64 { Some(c) } else { None } }).enumerate() {
        match i % 4 {
            0 => buf = c << 2,
            1 => { ret.push(buf | c >> 4); buf = c << 4; }
            2 => { ret.push(buf | c >> 2); buf = c << 6; }
            3 => ret.push(buf | c),
            _ => unreachable!(),
        }
    }
    ret
}

const TBL: &'static [u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const BIN: &'static str = "<base64-encoded ELF executable removed>";