#include <algorithm>
#include <cstdio>
#include <cstring>

const int MaxN = 100000, MaxM = 100000;
const int Mod = 998244353;

struct graph_t {
  int cnte;
  int head[MaxN + 5], to[MaxM + 5], next[MaxM + 5];
  graph_t() { cnte = 0; }

  inline void addEdge(int u, int v) {
    cnte++; to[cnte] = v;
    next[cnte] = head[u]; head[u] = cnte;
  }
};

int N, M;
int X[MaxN + 5];
int Deg[MaxN + 5], Vis[MaxN + 5];
struct edge_t { int u, v; } E[MaxM + 5];
graph_t Gr;

inline int add(int x, int y) { return (x += y) >= Mod ? x - Mod : x; }
inline int sub(int x, int y) { return (x -= y) < 0 ? x + Mod : x; }
inline int mul(int x, int y) { return 1LL * x * y % Mod; }
inline int pw(int x, int y) { int z = 1; for (; y; y >>= 1, x = mul(x, x)) if (y & 1) z = mul(z, x); return z; }
inline int inv(int x) { return pw(x, Mod - 2); }
inline int sep(int x, int y) { return mul(x, inv(y)); }
inline void inc(int &x, int y = 1) { (x += y) >= Mod ? x -= Mod : 0; }
inline void dec(int &x, int y = 1) { (x -= y) < 0 ? x += Mod : 0; }

void init() {
  scanf("%d %d", &N, &M);
  for (int i = 1; i <= N; ++i) scanf("%d", &X[i]);
  for (int i = 1; i <= M; ++i) {
    scanf("%d %d", &E[i].u, &E[i].v);
    E[i].u++, E[i].v++;
  }
}

void solve() {
  for (int i = 1; i <= M; ++i) {
    Deg[E[i].u]++;
    Deg[E[i].v]++;
  }
  for (int i = 1; i <= M; ++i) {
    int u = E[i].u, v = E[i].v;
    if (Deg[u] < Deg[v] || (Deg[u] == Deg[v] && u < v)) std::swap(u, v);
    Gr.addEdge(u, v);
  }
  int ans = 0;
  for (int u = 1; u <= N; ++u) {
    for (int i = Gr.head[u]; i; i = Gr.next[i]) {
      int v = Gr.to[i];
      Vis[v] = u;
    }
    for (int i = Gr.head[u]; i; i = Gr.next[i]) {
      int v = Gr.to[i];
      for (int j = Gr.head[v]; j; j = Gr.next[j]) {
        int w = Gr.to[j];
        if (Vis[w] == u) {
          // printf("(%d, %d, %d)\n", u, v, w);
          inc(ans, mul(X[u], mul(X[v], X[w])));
        }
      }
    }
  }
  printf("%d\n", ans);
}

int main() {
  init();
  solve();
  return 0;
}