#include<bits/stdc++.h> using namespace std; using ll=long long; int main(){ ll n,m; cin>>n>>m; vector<ll> a(n); for(ll i=0;i<n;i++){ cin>>a[i]; } vector<vector<ll>> G(n); for(ll i=0;i<m;i++){ ll u,v; cin>>u>>v; u--; v--; G[u].push_back(v); G[v].push_back(u); } ll mod=998244353; vector<ll> id(n,-1); vector<ll> sum; ll now=0; queue<ll> que; for(ll i=0;i<n;i++){ if(id[i]==-1){ id[i]=now; que.push(i); ll tmp=0; while(que.size()){ ll q=que.front(); que.pop(); tmp+=a[q]; tmp%=mod; for(ll u:G[q]){ if(id[u]==-1){ id[u]=now; que.push(u); } } } now++; sum.push_back(tmp); } } ll ans=1; for(ll i=0;i<n;i++){ ans*=sum[id[i]]; ans%=mod; } cout<<ans<<endl; }