import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd
from itertools import product, permutations
#重複あり：list(product(list('123'),repeat = 2)),重複なし：list(permutations(list('123')))
MOD = 998244353

n,m = map(int,input().split())
l = list(map(int,input().split()))
graph = [[]*m for _ in range(n)]

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


def dfs(crr, v):
    v[crr] = True
    road_s.add(crr)
    road_l.append(crr)
    for nxt in graph[crr]:
        if v[nxt]:continue
        dfs(nxt, v)
    #v[crr] = False
    #road.pop(crr)


ans=1
visit=set()
for i in range(n):
    if i in visit:continue
    vi=[False]*n
    road_s = set()
    road_l = []
    dfs(i,vi)
    visit |= road_s
    aa=0
    for j in list(road_s):
        aa += l[j]
    if aa:
        ans *= aa ** len(road_s)
        ans %= MOD

print(ans)