import sys
readline = sys.stdin.readline

#n,L,R = map(int,readline().split())
#*a, = map(int,readline().split())
n,m = map(int,readline().split())
*a, = map(int,readline().split())


g = [[] for _ in range(n)]
for _ in range(m):
    u,v = map(int,readline().split())
    u -= 1
    v -= 1
    g[u].append(v)
    g[v].append(u)

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

from heapq import *
q = [(a[0],0)]
dist = [-1]*n
dist[0] = a[0]

while q:
    c,v = q.pop()
    if dist[v] != -1 and c > dist[v]: continue
    for w in g[v]:
        gg = gcd(c,a[w])
        if gg == a[w]: continue
        nc = a[w]//gg*c
        if dist[w] == -1 or nc < dist[w]:
            dist[w] = nc
            heappush(q,(nc,w))

for i in dist:
    print(i%998244353)