import sys
from sys import stdin
from collections import deque, defaultdict

MOD = 998244353

def main():
    sys.setrecursionlimit(1 << 25)
    N = int(stdin.readline())
    Q = list(map(int, stdin.readline().split()))
    edges = [[] for _ in range(N)]
    for _ in range(N-1):
        u, v = map(int, stdin.readline().split())
        edges[u-1].append(v-1)
        edges[v-1].append(u-1)

    # Precompute inv_sqr: 1/(d^2) for d in 1..N
    inv_sqr = [0] * (N + 2)
    for d in range(1, N+1):
        inv_sqr[d] = pow(d * d % MOD, MOD-2, MOD)
    
    # Precompute k0 = (N!)^2 mod MOD
    fact = 1
    for i in range(1, N+1):
        fact = fact * i % MOD
    k0 = fact * fact % MOD
    
    # BFS for each node to compute the sum
    result = [0] * N
    for p in range(N):
        dist = [-1] * N
        q = deque()
        q.append(p)
        dist[p] = 0
        total = 0
        while q:
            u = q.popleft()
            total = (total + Q[u] * inv_sqr[dist[u] + 1]) % MOD
            for v in edges[u]:
                if dist[v] == -1:
                    dist[v] = dist[u] + 1
                    q.append(v)
        result[p] = total * k0 % MOD
    
    for res in result:
        print(res)
    
if __name__ == '__main__':
    main()