from collections import defaultdict
def solve(n, m, a, uv):
  mod = 998244353
  uf = [-1] * n
  sm = a[:]
  for ui, vi in uv:
    ru = root(uf, ui)
    rv = root(uf, vi)
    if ru == rv: continue
    su = sm[ru]
    sv = sm[rv]
    r = merge(uf, ui, vi)
    sm[r] = su + sv
  ans = 1
  for i in range(n):
    si = sm[root(uf, i)]
    ans *= si
    ans %= mod
  return ans

def root(uf, n):
  route = []
  i = n
  while uf[i] >= 0:
    route.append(i)
    i = uf[i]
  for r in route:
    uf[r] = i
  return i

def merge(uf, n, m):
  rootn = root(uf, n)
  rootm = root(uf, m)
  sizen = -uf[rootn]
  sizem = -uf[rootm]
  if rootn == rootm:
    return
  elif sizen < sizem:
    rootn, rootm = rootm, rootn
  uf[rootn] = -(sizen + sizem)
  uf[rootm] = rootn
  return rootn

n, m = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
uv = [[int(x) - 1 for x in input().split()] for _ in range(m)]

print(solve(n, m, a, uv))