#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5; 
const int P = 998244353; 

int n, m, ans, deg[N], a[N];
int u[N], v[N], vis[N];
vector<int> G[N];

int main(void) {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) scanf("%d", a + i); 
    for (int i = 1; i <= m; ++i) {
        scanf("%d%d", u + i, v + i);
        ++deg[u[i]]; ++deg[v[i]];
    }
    for (int i = 1; i <= m; ++i) {
        int x = u[i], y = v[i];
        if (deg[x] < deg[y] || (deg[x] == deg[y] && x < y)) swap(x, y);   
        G[x].emplace_back(y);
    }
    for (int u = 1; u <= n; ++u) {
        for (int v : G[u]) vis[v] = u;
        for (int v : G[u]) for (int w : G[v])
            if (vis[w] == u) ans = (ans + 1ll * a[u] * a[v] % P * a[w]) % P; 
    }
    printf("%d\n", ans);
    return 0;
}