#![allow(unused)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(solve)?
        .join()
        .unwrap();
    Ok(())
}

fn solve() {
    let stdin = io::stdin();
    let mut kin = KInput::new(stdin.lock());
    let stdout = io::stdout();
    let mut out = io::BufWriter::new(stdout.lock());
    macro_rules! output {($($args:expr),+) => { write!(&mut out, $($args),+) }; }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } }
    }

    let n: usize = kin.input();
    let mut c = vec![0];
    c.extend(kin.iter::<usize>().take(n));
    let mut g = vec![vec![]; n + 1];
    for _ in 0..n - 1 {
        let (a, b): (usize, usize) = kin.input();
        g[a].push(b);
        g[b].push(a);
    }
    let m = (n * (n + 1) / 2) as isize;
    let mut sub = vec![1; n + 1];
    let mut comp = vec![n as isize; n + 1];
    let mut ans = vec![m; n + 1];
    let mut dfs = Dfs {
        c, sub, comp, ans
    };
    dfs.dfs(&g, 1, 0);
    for i in 1..=n {
        dfs.ans[i] -= dfs.comp[i] * (dfs.comp[i] + 1) / 2;
    }
    for i in 1..=n {
        outputln!("{}", dfs.ans[i]);
    }
}

struct Dfs {
    c: Vec<usize>,
    sub: Vec<isize>,
    comp: Vec<isize>,
    ans: Vec<isize>,
}
impl Dfs {
    fn dfs(&mut self, g: &[Vec<usize>], u: usize, p: usize) {
        let col = self.c[u];
        let comp_temp = self.comp[col];
        for &v in g[u].iter().filter(|&&v| v != p) {
            self.comp[col] = 0;
            self.dfs(g, v, u);
            self.comp[col] += self.sub[v];
            self.ans[col] -= self.comp[col] * (self.comp[col] + 1) / 2;
            self.sub[u] += self.sub[v];
        }
        self.comp[col] = comp_temp - self.sub[u];
    }
}


// -----------------------------------------------------------------------------
pub mod kyoproio {
    #![warn(unused)]
    use std::io::prelude::*;
    pub trait Input {
        fn str(&mut self) -> &str;
        fn bytes(&mut self) -> &[u8] {
            self.str().as_ref()
        }
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1024),
                pos: 0,
            }
        }
    }
    impl<R: BufRead> Input for KInput<R> {
        fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.pos = 0;
                    self.buf.clear();
                    if self.src.read_line(&mut self.buf).expect("io error") == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end > range.start {
                    return &self.buf[range];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<Self::Item> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        fn input<I: Input + ?Sized>(input: &mut I) -> Self;
    }
    impl InputParse for Vec<u8> {
        fn input<I: Input + ?Sized>(input: &mut I) -> Self {
            input.bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<I: Input + ?Sized>(input: &mut I) -> Self {
                    input.str().parse::<$T>().expect("parse error")
                }
            })*
        };
    }
    from_str_impl! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(input: &mut I) -> Self {
                    ($H::input(input), $($T::input(input)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {};
    }
    tuple_impl!(A B C D E F G);
}


Measured memory_bytes: 39212