#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll N=1e5+3,H=99824453;
ll n,m,B,ans,a[N],kx[N],ky[N];
vector<int>ve[N];
unordered_map<ll,int>mp;
bool vis[N];
ll Num(ll x,ll y){return x*N+y;}
int main()
{
	cin>>n>>m;B=sqrt(n);
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1,x,y;i<=m;i++)
	    cin>>x>>y,ve[++x].push_back(++y),ve[y].push_back(x),kx[i]=x,ky[i]=y,mp[Num(x,y)]=mp[Num(y,x)]=1;
	for(int i=1,x,y;i<=n;i++)if(ve[i].size()<=B)
	{
		for(int px=0;px<(int)ve[i].size();px++)if((x=ve[i][px])>i)
		for(int py=px+1;py<(int)ve[i].size();py++)if((y=ve[i][py])>i)
		    if(mp.count(Num(x,y)))ans=(ans+a[i]*a[x]%H*a[y])%H;
	}
	for(int i=1;i<=n;i++)if(ve[i].size()>B)
	{
		memset(vis,0,sizeof(vis));
		for(int z:ve[i])vis[z]=z>i;
		for(int j=1;j<=m;j++)if(vis[kx[j]]&&vis[ky[j]])ans=(ans+a[i]*a[kx[j]]%H*a[ky[j]])%H; 
	}
	cout<<ans;
}