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

# UnionFind

Group = [i for i in range(N+1)] # グループ分け
Nodes = [1]*(N+1) # 各グループのノードの数

def find(x):
    while Group[x] != x:
        x=Group[x]
    return x

def Union(x,y):
    if find(x) != find(y):
        if Nodes[find(x)] < Nodes[find(y)]:
            
            Nodes[find(y)] += Nodes[find(x)]
            Nodes[find(x)] = 0
            Group[find(x)] = find(y)
            
        else:
            Nodes[find(x)] += Nodes[find(y)]
            Nodes[find(y)] = 0
            Group[find(y)] = find(x)

for i in range(M):
    u,v=map(int,input().split())
    Union(u,v)

ANS=[0]*(N+1)

for i in range(1,N+1):
    ANS[find(i)]+=A[i-1]

score=1

for i in range(1,N+1):
    score=score*ANS[find(i)]%998244353

print(score)