#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define all(a) (a).begin(),(a).end()

#include <atcoder/modint>
#include <atcoder/dsu>
using namespace atcoder;
using mint = modint998244353;

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    int N, M;
    cin >> N >> M;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];
    
    dsu uf(N);
    rep(i, 0, M) {
        int U, V;
        cin >> U >> V;
        --U, --V;
        uf.merge(U, V);
    }
    
    mint ans = 1;
    vector<vector<int>> group = uf.groups();
    rep(i, 0, group.size()) {
        mint t = 0;
        rep(j, 0, group[i].size()) t += A[group[i][j]];
        ans *= t.pow(group[i].size());
    }
    
    cout << ans.val() << '\n';
}