#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef pair<int,int> P;
typedef long double ld;

using mint = modint998244353;

template<typename T>
istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template <typename T>
ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

int main(){
	int n, m;
	cin >> n >> m;
	vi a(n);
	cin >> a;
	dsu d(n);
	rep(i, m){
		int u, v;
		cin >> u >> v;
		u--; v--;
		d.merge(u, v);
	}
	auto g = d.groups();
	mint ans = 1;
	for(auto& v: g){
		mint tmp = 0;
		for(int x : v) tmp += a[x];
		ans *= tmp.pow(int(v.size()));
	}
	cout << ans.val();
	return 0;
}