#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N, M;
  cin >> N >> M;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<vector<int>> E(N);
  for (int i = 0; i < M; i++){
    int U, V;
    cin >> U >> V;
    U--;
    V--;
    E[U].push_back(V);
    E[V].push_back(U);
  }
  long long ans = 1;
  vector<bool> used(N, false);
  for (int i = 0; i < N; i++){
    if (!used[i]){
      used[i] = true;
      int cnt = 0;
      long long sum = 0;
      queue<int> Q;
      Q.push(i);
      while (!Q.empty()){
        int v = Q.front();
        Q.pop();
        cnt++;
        sum += A[v];
        sum %= MOD;
        for (int w : E[v]){
          if (!used[w]){
            used[w] = true;
            Q.push(w);
          }
        }
      }
      for (int j = 0; j < cnt; j++){
        ans *= sum;
        ans %= MOD;
      }
    }
  }
  cout << ans << endl;
}