from collections import defaultdict class UnionFind(): def __init__(self, n): ''' UnionFindクラス。nは要素数を表す。 ''' self.n = n self.parents = [-1] * n def find(self, x): ''' 要素xを含む集合の親を見つける関数。 ''' if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): ''' 要素xを含む集合と要素yを含む集合を合体する関数。 基本的には、要素数が多い集合に統合される。 要素数が同じときは要素yを含む集合に統合される。 ''' x = self.find(x) y = self.find(y) if x == y: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): ''' 要素xを含む集合の要素数を出す関数。 ''' return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return len(self.roots()) def all_group_members(self): group_members = defaultdict(list) for member in range(self.n): group_members[self.find(member)].append(member) return group_members def __str__(self): return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items()) n, m = map(int, input().split()) A = list(map(int, input().split())) UF = UnionFind(n) for _ in range(m): u, v = map(int, input().split()) u -= 1 v -= 1 if UF.same(u, v): continue UF.union(u, v) seen = set() R = [-1 for _ in range(n)] mod = 998244353 ans = 1 for i in range(n): if i in seen: root = UF.find(i) ans *= R[root] ans %= mod continue res = 0 G = UF.members(i) for g in G: res += A[g] res %= mod seen.add(g) root = UF.find(i) R[root] = res ans *= res ans %= mod print(ans)