from collections import Counter


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, v = u - 1, v - 1
    g[u].append(v)
    g[v].append(u)

def prime_factorize(n: int):
    primes = []
    while n % 2 == 0:
        primes.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            primes.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        primes.append(n)
    return primes

dp = [Counter(prime_factorize(a)) for a in A]
def dfs(u, p):
    for v in g[u]:
        if v == p:
            continue
        dfs(v, u)
        for k, v in dp[v].items():
            if k in dp[u]:
                dp[u][k] = max(dp[u][k], v)
            else:
                dp[u][k] = v
    return dp[u]

dfs(0, -1)
mod = 998244353
for i in range(N):
    ans = 1
    for k, v in dp[i].items():
        ans *= k ** v
        ans %= mod
    print(ans)