n,m = map(int,input().split())
A = list(map(int,input().split()))
mod = 998244353
e = [[] for i in range(n)]
for _ in range(m):
    u,v = [int(x)-1 for x in input().split()]
    e[u].append(v)
    e[v].append(u)


divs = set()
for a in A:
    now = a
    for i in range(2,int(a**0.5)+1):
        if now%i:
            continue

        divs.add(i)
        while now%i == 0:
            now //= i

    if now != 1:
        divs.add(now)


ans = [1]*n

def calc(d,ans):

    vis = [0]*n
    ok = [0]*n
    nexs = set()

    nums = [[0,i] for i in range(n)]
    for i,a in enumerate(A):
        while a%d == 0:
            a //= d
            nums[i][0] += 1
    
    nums.sort()

    nexs.add(0)


    for num,ind in nums:
        ok[ind] = 1

        if ind not in nexs:
            continue

        vis[ind] = 1
        q = [ind]

        while q:
            now = q.pop()
            ans[now] *= pow(d,num,mod)
            ans[now] %= mod

            for nex in e[now]:
                if vis[nex]:
                    continue
                if ok[nex]:
                    vis[nex] = 1
                    q.append(nex)
                else:
                    nexs.add(nex)
    return ans

for d in divs:
    ans = calc(d,ans)

for i in ans:
    print(i)