#include <bits/stdc++.h>
using namespace std;
int par[200020];
using ll = long long;
ll const m = 998244353;
ll A[200020];
ll val[200020];
int siz[200020];
void init(int N) {
	iota(par, par + N, 0);
	fill(siz, siz + N, 1);
	for (int i = 0; i < N; i ++) val[i] = A[i];
}
int root(int v) {
	return par[v] = (v == par[v] ? v : root(par[v]));
}
void merge(int a, int b) {
	a = root(a); b = root(b);
	if (a == b) return;
	if (siz[a] < siz[b]) swap(a, b);
	par[b] = a;
	siz[a] += siz[b];
	val[a] += val[b];
	val[a] %= m;
}
int main() {
	int N, M;
	cin >> N >> M;
	for (int i = 0; i < N; i ++) cin >> A[i];
	init(N);
	while (M--) {
		int a, b;
		cin >> a >> b;
		merge(--a, --b);
	}
	ll ans = 1;
	for (int i = 0; i < N; i ++) {
		ans = (ans * val[root(i)]) % m;
	}
	cout << ans << endl;
}