#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
const ll mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline int lg2(int x){ return 31^__builtin_clz(x); }
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
void init(){ }
const ll B = 450;
unordered_map<ll,bool>mp[100005];
ll n,m,x[100005],u[100005],v[100005],ans;
bool vis[100005];
vector<ll>E[100005];

void contri(ll a,ll b,ll c){
	ans = (ans + x[a] * x[b] % mod * x[c]) % mod;
}
void procedure(){

	n=read(), m=read();
	for(ll i=1;i<=n;i++)
		x[i]=read();
	for(ll i=1;i<=m;i++){
		u[i]=read()+1, v[i]=read()+1;
		mp[u[i]][v[i]] = mp[v[i]][u[i]] = 1;
		E[u[i]].pb(v[i]); E[v[i]].pb(u[i]);
	}
	for(ll i=1;i<=n;i++){
		if(E[i].size()>=B){
			for(auto x: E[i]) vis[x]=1;
			for(ll j=1;j<=m;j++)
				if(vis[u[j]] && vis[v[j]] && u[j]>i && v[j]>i) contri(i,u[j],v[j]);
			for(auto x: E[i]) vis[x]=0;
		}else{
			for(auto x: E[i]){
				for(auto y: E[i]){
					if(i>=x || x>=y) continue;
					if(mp[x].count(y)) contri(i,x,y);
				}
			}
		}
	}
	printf("%lld\n", ans);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	init();
	while(T--) procedure();
	return 0;
}