#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);
struct UnionFind{
    vector<int> par, siz;
    UnionFind(int N) : par(N), siz(N,1){
        rep(i,N) par[i] = i;
    }
    int root(int x){
        if(par[x]==x) return x;
        return par[x] = root(par[x]);
    }
    bool unite(int x,int y){
        x = root(x); y = root(y);
        if(x==y) return false;
        if(siz[x]<siz[y]) swap(x,y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    int size(int x){
        return siz[root(x)];
    }
    bool same(int x,int y){
        return root(x) == root(y);
    }
};
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    UnionFind uf(n);
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    rep(i,m){
        int u,v;
        cin >> u >> v;
        uf.unite(u-1,v-1);
    }
    vector<ll> ans(n,0);
    rep(i,n) ans[uf.root(i)] = (ans[uf.root(i)] + a[i]) % MOD;
    ll tot = 1;
    rep(i,n) tot = tot * ans[uf.root(i)] % MOD;
    cout << tot << '\n';
    return 0;
}