MOD = 998244353

N, M = map(int, input().split())
A = list(map(int, input().split()))
G = [[] for _ in range(N)]
for _ in range(M):
  u, v = map(int, input().split())
  u -= 1; v -= 1
  G[u].append(v)
  G[v].append(u)

seen = [False]*N
stack = []
ans = 1
for i in range(N):
  if seen[i]: continue
  cnt = sum = 0 
  seen[i] = True
  stack.append(i)
  while stack:
    u = stack.pop()
    cnt += 1; sum += A[u]
    for v in G[u]:
      if not seen[v]:
        seen[v] = True
        stack.append(v)
  ans *= pow(sum % MOD, cnt, MOD)
  ans %= MOD

print(ans)