#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool inline chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }
template <typename T> bool inline chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
	x = 0; int f = 1; char s = getchar();
	while (s > '9' || s < '0') { if (s == '-') f = -1; s = getchar(); }
	while (s <= '9' && s >= '0') x = x * 10 + s - '0', s = getchar();
	x *= f;
}

const int N = 1e5 + 5, P = 998244353;

int n, m, w[N], A[N], B[N], d[N], p[N], pos[N], c[N];

vector<int> g[N];

int main() {
	read(n), read(m);
	for (int i = 1; i <= n; i++) read(w[i]);
	for (int i = 1; i <= m; i++) {
		read(A[i]), read(B[i]);
		++A[i], ++B[i];
		d[A[i]]++, d[B[i]]++;
		p[i] = i;
	}
	sort(p + 1, p + 1 + n, [&] (int x, int y) { return d[x] < d[y]; });
	for (int i = 1; i <= n; i++) pos[p[i]] = i;
	for (int i = 1; i <= m; i++) {
		int u = A[i], v = B[i];
		if (pos[u] > pos[v]) swap(u, v);
		g[u].pb(v);
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int v: g[i]) {
			c[v] = 1;
		}
		int t = 0;
		for (int v: g[i]) {
			LL s = 0;
			for (int u: g[v]) {
				if (c[u]) s += w[u];
			}
			t = (t + s % P * w[v]) % P;	
		}
		ans = (ans + 1ll * t * w[i]) % P;
		for (int v: g[i]) {
			c[v] = 0;
		}
	}
	printf("%d\n", ans);
	return 0;
}