// g++-13 4.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

using mint = modint998244353;

constexpr ll mod = 998244353;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n,m;cin>>n>>m;
  vector<mint> a(n);
  rep(i,0,n){
    int ai;cin>>ai;
    a[i]=ai;
  }

  dsu d(n);
  rep(i,0,m){
    int u,v;cin>>u>>v;
    u--;v--;
    d.merge(u,v);
  }

  mint ans=1;
  vvi g=d.groups();

  for(vi gg:g){
    int s=gg.size();
    mint sm=0;
    for(int id:gg)sm+=a[id];
    ans*=pow_mod(sm.val(),s,mod);
  }  

  cout<<ans.val()<<endl;
}