#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005, P = 998244353;
vector<int> e[MAXN];
int n, m;
int x[MAXN];
int u[MAXN], v[MAXN], deg[MAXN];
int cnt[MAXN];
int main() {
    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", &u[i], &v[i]);
        u[i]++, v[i]++;
        deg[u[i]]++, deg[v[i]]++;
    }
    for (int i = 1; i <= m; i++) {
        if (deg[u[i]] < deg[v[i]] || (deg[u[i]] == deg[v[i]] && u[i] > v[i])) swap(u[i], v[i]);
        e[u[i]].push_back(v[i]);
        // printf("%d -> %d\n", u[i], v[i]);
    }
    int ans = 0;
    for (int u = 1; u <= n; u++) {
        for (int v : e[u]) {
            cnt[v] = (cnt[v] + x[u] * x[v]) % P;
        }
        for (int v : e[u]) {
            for (int w : e[v]) {
                ans = (ans + 1ll * cnt[w] * x[v]) % P;
            }
        }
        for (int v : e[u]) {
            cnt[v] = 0;
        }
    }
    printf("%d\n", ans);
    return 0;
}