import math MOD = 998244353 N = int(input()) a_list = list(map(int, input().split())) graph = [[] for n in range(N + 1)] for n in range(N - 1): u, v = map(int, input().split()) graph[u].append(v) graph[v].append(u) used = [False]*(N + 1) res = [0]*(N + 1) def dfs(now): a = a_list[now - 1] neibors = graph[now] used[now] = True if len(neibors) == 1: res[now] = a # print(f"{now}:{res}") return a else: a_s = [a] for neibor in neibors: if used[neibor] is True: continue else: used[neibor] = True c = dfs(neibor) a_s.append(c) # print(f"{now}:{a_s}") r = math.lcm(*a_s) % MOD res[now] = r # print(f"{now}:{res}") return r dfs(1) # print(res) for n in range(1, N + 1): print(res[n])