#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

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

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  rep(i, n) cin >> a[i];
  atcoder::dsu d(n);
  rep(_, m) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    d.merge(u, v);
  }
  vector<mint> sum(n, 0);
  rep(i, n) sum[d.leader(i)] += a[i];
  mint ans = 1;
  rep(i, n) ans *= sum[d.leader(i)];
  cout << ans.val() << '\n';
  return 0;
}