import math

def dfs(v, p):
    ans[v] = [A[v], A[v]]
    for nv in G[v]:
        if nv==p:
            continue
        dfs(nv, v)
        ans[v][0] = math.gcd(ans[v][1], ans[nv][1])
        ans[v][1] = ans[v][1]*ans[nv][1]//ans[v][0]

from collections import defaultdict
import sys
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
MOD = 998244353
N = int(input())
A = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(N-1):
    u, v = map(int, input().split())
    u-=1
    v-=1
    G[u].append(v)
    G[v].append(u)
ans = [[] for _ in range(N)]
dfs(0, -1)
for a in ans:
    print(a[1]%MOD)