from heapq import *
from math import gcd
lcm = lambda a,b: a//gcd(a,b)*b
import sys
readline = sys.stdin.readline

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

q = [(a[0],0)]
dist = [0]*n
dist[0] = a[0]

while q:
    c,v = q.pop()
    if dist[v] and c > dist[v]: continue
    for w in g[v]:
        nc = gcd(lcm(c,a[w]),dist[w])
        if dist[w] != 0 and nc == dist[w]: continue
        dist[w] = gcd(nc,dist[w])
        heappush(q,(dist[w],w))

for i in dist:print(i%998244353)