n,m = map(int,input().split())
alist = list(map(int,input().split()))
import collections
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, 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 = 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):
        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 = collections.defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return ''.join(f'{r}: {m}' for r, m in self.all_group_members().items())
edge = [[] for i in range(n)]
uf = UnionFind(n)
for i in range(m):
    u,v = map(int,input().split())
    u,v = u-1,v-1
    edge[u].append(v)
    edge[v].append(u)
    if not uf.same(u,v):
        uf.union(u,v)
ans = 1
mod = 998244353
x = uf.all_group_members()
for i in x:
    temp = 0
    for j in x[i]:
        temp += alist[j]
        temp %= mod
    ans *= pow(temp,len(x[i]),mod)
    ans %= mod
print(ans)