#include<cstdio>
#include<algorithm>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
using namespace std;
typedef unsigned long long ull;
constexpr int N=1e5+5,MOD=998244353;
int n,m,a[N],aa[N],deg[N],id[N],e[N][2],po[2*N],*adj[N];
bool vis[N];
int main()
{
	scanf("%d%d",&n,&m);
	F(i,0,n)scanf("%d",&aa[i]);
	F(i,0,m)scanf("%d%d",&e[i][0],&e[i][1]),++deg[e[i][0]],++deg[e[i][1]];
	F(i,0,n)id[i]=i;
	sort(id,id+n,[](const int &u,const int &v){return deg[u]>deg[v];});
	F(i,0,n)a[i]=aa[id[i]];
	F(i,0,n)aa[id[i]]=i,deg[i]=0;
	F(i,0,n)
	{
		e[i][0]=aa[e[i][0]];e[i][1]=aa[e[i][1]];
		if(e[i][0]>e[i][1])swap(e[i][0],e[i][1]);
		++deg[e[i][0]];
	}
	adj[0]=po;
	F(i,0,n)adj[i+1]=adj[i]+deg[i],deg[i]=0;
	F(i,0,m)adj[e[i][0]][deg[e[i][0]]++]=e[i][1];
	int ans=0;
	F(u,0,n)
	{
		F(j,0,deg[u])vis[adj[u][j]]=true;
		int sum=0;
		F(j,0,deg[u])
		{
			int v=adj[u][j];
			F(k,0,deg[v])
			{
				int w=adj[v][k];
				if(vis[w])sum=(int)((sum+(ull)a[v]*a[w])%MOD);
			}
		}
		ans=(int)((ans+(ull)sum*a[u])%MOD);
		F(j,0,deg[u])vis[adj[u][j]]=false;
	}
	printf("%d\n",ans);
	return 0;
}