#include <stdio.h>
#include <algorithm>
#define sz 100005
const int md = 998244353;
struct site
{
	int ed, next;
};
int n, m, now;
bool vis[sz];
int fsl[sz], ds[sz], wei[sz];
site edg[sz], dld[sz];
int read();
void net(int, int);
int main()
{
	int x, y;
	n = read(); m = read();
	for (int i = 1; i <= n; ++i)
		wei[i] = read();
	for (int i = 1; i <= m; ++i)
	{
		edg[i].ed = read() + 1;
		edg[i].next = read() + 1;
		++ds[edg[i].ed]; ++ds[edg[i].next];
	}
	for (int i = 1; i <= m; ++i)
	{
		if (ds[edg[i].ed] > ds[edg[i].next] || (ds[edg[i].ed] == ds[edg[i].next] && edg[i].ed > edg[i].next))
			std::swap(edg[i].ed, edg[i].next);
		net(edg[i].ed, edg[i].next);
	}
	x = 0;
	for (int i = 1; i <= n; ++i)
	{
		for (int j = fsl[i]; j; j = dld[j].next)
			vis[dld[j].ed] = true;
		for (int j = fsl[i]; j; j = dld[j].next)
			for (int k = fsl[dld[j].ed]; k; k = dld[k].next)
				x = (x + (long)wei[i] * wei[dld[j].ed] % md * wei[dld[k].ed]) % md;
		for (int j = fsl[i]; j; j = dld[j].next)
			vis[dld[j].ed] = false;
	}
	printf ("%d\n", x);
	return 0;
}

int read()
{
	int x = 0;
	char c = getchar();
	while (c < '0') c = getchar();
	do {
		x = x * 10 + (c & 15);
		c = getchar();
	}while (c >= '0');
	return x;
}

void net(int a, int b)
{
	dld[++now].ed = b;
	dld[now].next = fsl[a];
	fsl[a] = now;
}