#int(input())
#map(int, input().split())
#list(map(int, input().split()))

import sys
sys.setrecursionlimit(200000)


N, M = map(int, input().split())
A = list(map(int, input().split()))

to = [[] for i in range(N)]
for i in range(M):
    a, b = map(int, input().split())
    to[a-1].append(b-1)
    to[b-1].append(a-1)

mod = 998244353

# p = [0] * N
v = [0] * N
ans = 1
for i in range(N):
    if v[i] != 0:
        continue
    q = [i]
    v[i] = 1
    s = A[i]
    c = 1
    while q:
        t = q.pop()
        for y in to[t]:
            if v[y] == 0:
                q.append(y)
                v[y] = 1
                s += A[y]
                s %= mod
                c += 1

    ans = (ans * pow(s, c, mod)) % mod


print(ans)