from math import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

N, M = map(int, input().split())
A = list(map(int,input().split()))
g = [[] for _ in range(N)]
for _ in range(M):
    u, v = map(int, input().split())
    g[u - 1].append(v - 1)
    g[v - 1].append(u - 1)

visited = [False] * N
ans = [-1] * N
def dfs(now, goal, num):
    if now == goal:
        if ans[now] == -1:
            ans[now] = num
        else:
            ans[now] = gcd(ans[now], num)
        return 
    
    visited[now] = True
    for nxt in g[now]:
        if visited[nxt] : 
            continue
        dfs(nxt, goal, lcm(num, A[nxt]))
    visited[now] = False
    return 

for i in range(N):
    visited[0] = True
    dfs(0, i, A[0])
    visited[0] = False

for i in range(N):
    print(ans[i] % 998244353)