#include<cstdio>
#define fo(i,x,y) for(int i = x;i <= y;++i)
#define fd(i,x,y) for(int i = x;i >= y;--i)
#define _is 1048576 * 4
#define gc() ib[++bi]
#define p 998244353
using namespace std;
char ib[_is];int bi = -1;
int rd()
{
	int x = 0;char ch = gc();
	while(ch < 48 || ch > 57) ch = gc();
	while(ch >= 48 && ch <= 57) x = x * 10 + ch - 48,ch = gc();
	return x;
}
int n,m,a[100010],e[100010][2],lst[100010],tot,x[100010],y[100010],d[100010];
bool bz[100010];
void add(int x,int y) {e[++tot][0] = y,e[tot][1] = lst[x],lst[x] = tot;}
int main()
{
	fread(ib,1,_is,stdin);
	n = rd(),m = rd();
	fo(i,1,n) a[i] = rd();
	fo(i,1,m) x[i] = rd() + 1,y[i] = rd() + 1,++d[x[i]],++d[y[i]];
	fo(i,1,m) d[x[i]] < d[y[i]] ? add(x[i],y[i]) : add(y[i],x[i]);
	int ans = 0;
	fo(i,1,n)
	{
		for(int j = lst[i];j;j = e[j][1]) bz[e[j][0]] = 1;
		for(int j = lst[i];j;j = e[j][1]) for(int k = lst[e[j][0]];k;k = e[k][1]) if(bz[e[k][0]]) ans = (ans + 1ll * a[i] * a[e[j][0]] % p * a[e[k][0]]) % p;
	}
	printf("%d\n",ans);
}