N,M=map(int, input().split())
A=list(map(int, input().split()))
B=[0]*N;C=[]
par=[i for i in range(N)]
rank=[0]*(N)
friend=[0]*N
block=[0]*N
size=[1]*N
def find(x):
  if par[x]==x:
    return x
  else:
    par[x]=find(par[x])
    return par[x]
 
#同じ集合か判定
def same(x,y):
  return find(x)==find(y)
 
def union(x,y):
  x=find(x)
  y=find(y)
  if x==y:
    return 
  if rank[x]>rank[y]:
    par[y]=x
    size[x]+=size[y]
  else:
    par[x]=y
    size[y]+=size[x]
    if rank[x]==rank[y]:
      rank[y]+=1
 
 
for i in range(M):
  u,v=map(int, input().split())
  u-=1;v-=1
  C.append((u,v))
  union(u,v)
  
D={}
for i in range(N):
  d=find(i)
  if d not in D:
    D[d]=[]
  D[d].append(i)

ans=1;mod=998244353
for d in D:
  c=0
  for a in D[d]:
    c+=A[a]
  for i in range(len(D[d])):
    ans*=c 
    ans%=mod 
print(ans)