import sys
input = sys.stdin.readline
sys.setrecursionlimit(500000)
mod=998244353
n,m=map(int,input().split())
a=list(map(int,input().split()))
def Eratosthenes(N): #N以下の素数のリストを返す
    N+=1
    is_prime_list = [True]*N
    m = int(N**0.5)+1
    for i in range(3,m,2):
        if is_prime_list[i]:
            is_prime_list[i*i::2*i]=[False]*((N-i*i-1)//(2*i)+1)
    return [2] + [i for i in range(3,N,2) if is_prime_list[i]]
e=Eratosthenes(10**6)
from collections import defaultdict
def factorization(n):
    global e
    arr = defaultdict(int)
    temp = n
    sqrtn=int(-(-n**0.5//1))+1
    for i in e:
      if i<=sqrtn:
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr[i]=cnt
      else:
        break
    if temp!=1:
        arr[temp]=1
    if arr==[]:
        if n!=1:
          arr[n]=1
    return arr
A=[]
for i in range(n):
  A.append(factorization(a[i]))
adj = [[] for _ in range(n)]
for _ in range(m):
  u,v = map(int, input().split())
  adj[u-1].append(v-1)
  adj[v-1].append(u-1)
seen = [0]*n
from collections import defaultdict
memo=[[] for _ in range(n)]
def dfs(pa,v):
  global dic,memo
  seen[v]=1
  for i in A[v]:
    dic[i]=max(dic[i],A[v][i])
  dic2=defaultdict(int)
  for i in dic:
    dic2[i]=dic[i]
  memo[v].append(dic2)
  for w in adj[v]:
    if seen[w]==0:
      dfs(v,w)
  seen[v]=0
  if pa>-1:
    dic=defaultdict(int)
    v=memo[pa][-1]
    for i in v:
      dic[i]=v[i]
dic=defaultdict(int)
dfs(-1,0)
for i in range(n):
  dic=memo[i][0]
  for d in memo[i]:
    for j in d:
      dic[j]=min(dic[j],d[j])
  ans=1
  for i in dic:
    ans*=pow(i,dic[i],mod)
    ans%=mod
  print(ans)