#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned ll;using pii=pair<int,int>;
const int N=1e5+5,M=N*30+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,rk[N],id[N],A[N],X[N],Y[N],in[N];
vector<int> S[N];
void Solve(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&A[i]);
	for(int i=1;i<=m;i++){
		scanf("%d%d",&X[i],&Y[i]);
		X[i]++;Y[i]++;
		in[X[i]]++;in[Y[i]]++;
	}
	iota(id+1,id+n+1,1);
	sort(id+1,id+n+1,[](int x,int y){return in[x]<in[y];});
	for(int i=1;i<=n;i++) rk[id[i]]=i;
	for(int i=1;i<=m;i++){
		if(rk[X[i]]>rk[Y[i]]) swap(X[i],Y[i]);
		S[X[i]].push_back(Y[i]);
	}
	ll ans=0;
	for(int i=1;i<=n;i++){
		static int ap[N];
		for(int j:S[i]) ap[j]=1;
		for(int j:S[i]) for(int h:S[j]) if(ap[h]) ans+=A[i]*A[j]%mod*A[h]%mod;
		for(int j:S[i]) ap[j]=0;
	}
	printf("%lld\n",ans%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}