from collections import deque


def bfs(s):
    dq = deque()
    dq.append([s, 0])
    dist = [10**9 for _ in range(N)]
    dist[s] = 0
    res = []
    while len(dq) != 0:
        p, h = dq.popleft()
        res.append(p)
        for e in edge[p]:
            if dist[e] == 10**9:
                dq.append([e, h + 1])
                dist[e] = h + 1
    return res

import math
N=int(input())
A=list(map(int,input().split()))
edge = [[] for _ in range(N)]
for _ in range(N-1):
    a,b=map(int,input().split())
    a-=1
    b-=1
    edge[a].append(b)
    edge[b].append(a)
r = bfs(0)
print(r)
dp = [-1 for _ in range(N)]
for v in r[::-1]:
    dp[v] = A[v]
    for nv in edge[v]:
        if dp[nv] == -1:
            continue
        dp[v] = math.lcm(dp[v], dp[nv])
mod = 998244353
print(*[d%mod for d in dp], sep="\n")