// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <queue>
#include <random>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.
const ullt Mod=998244353;
std::vector<uint>Way[100005];
ullt W[100005];
uint P[100005];
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
	uint n,m;scanf("%u%u",&n,&m);for(uint i=0;i<n;i++)scanf("%llu",W+i),P[i]=i;
	while(m--){uint u,v;scanf("%u%u",&u,&v),Way[u].push_back(v),Way[v].push_back(u);}
	std::sort(P,P+n,[&](uint a,uint b){return Way[a].size()<Way[b].size();});
	for(uint i=0;i<n;i++)
	{
		static bol B[100005];
		B[P[i]]=true;
		std::vector<uint>S;for(auto s:Way[P[i]])if(!B[s])S.push_back(s);
		Way[P[i]]=S;
	}
	ullt ans=0;
	for(uint i=0;i<n;i++)
	{
		static bol B[100005];
		for(auto s:Way[P[i]])B[s]=true;
		ullt wil=0;
		for(auto s:Way[P[i]])
		{
			ullt r=0;
			for(auto t:Way[s])if(B[s])r+=W[t];
			if(r)wil=(wil+r%Mod*W[s])%Mod;
		}
		ans=(ans+wil*W[P[i]])%Mod;
		for(auto s:Way[P[i]])B[s]=false;
	}
	printf("%llu\n",ans);
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。