# UnionFind
class UnionFind:
    def __init__(self,n):
        self.n=n
        self.parent_size=[-1]*n

    def leader(self,a):
        if self.parent_size[a]<0: return a
        self.parent_size[a]=self.leader(self.parent_size[a])
        return self.parent_size[a]

    def merge(self,a,b):
        x,y=self.leader(a),self.leader(b)
        if x == y: return 
        if abs(self.parent_size[x])<abs(self.parent_size[y]):x,y=y,x
        self.parent_size[x] += self.parent_size[y]
        self.parent_size[y]=x
        return 

    def same(self,a,b):
        return self.leader(a) == self.leader(b)

    def size(self,a):
        return abs(self.parent_size[self.leader(a)])

    def groups(self):
        result=[[] for _ in range(self.n)]
        for i in range(self.n):
            result[self.leader(i)].append(i)
        return [r for r in result if r != []]

# code
N, M = map(int, input().split())
An = list(map(int, input().split()))
mod = 998244353

UF = UnionFind(N+1)
for m in range(M):
    U, V = map(int, input().split())
    UF.merge(U, V)

data = 1
for s in UF.groups():
    now = 0
    if s == [0]:
        continue

    for t in s:
        if now == 0:
            now = An[t-1]
        
        else:
            now += An[t-1]
            now %= mod

    for _ in range(len(s)):
        data *= now
        data %= mod

print(data)