#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll mod = 998244353;
const int maxn = 1e5 + 5;

ll x[maxn];
int deg[maxn], U[maxn], V[maxn];
vector<int> g[maxn];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> x[i];
    for (int i = 1; i <= m; i++)
    {
        int u, v; cin >> u >> v;
        u++, v++; deg[u]++, deg[v]++;
        U[i] = u, V[i] = v;
    }
    for (int i = 1; i <= m; i++)
        if (deg[U[i]] < deg[V[i]] || (deg[U[i]] == deg[V[i]] && U[i] < V[i])) g[U[i]].emplace_back(V[i]);
        else g[V[i]].emplace_back(U[i]);
    
    ll ans = 0;
    for (int u = 1; u <= n; u++)
        for (int i = 0; i < g[u].size(); i++)
            for (int j = i + 1; j < g[u].size(); j++)
                (ans += x[u] * x[g[u][i]] % mod * x[g[u][j]]) %= mod;
    cout << ans;
    return 0;
}