#include <iostream>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
const int N=1e6+9,INF=1e9,mod=998244353;
const double eps=1e-5;
typedef pair <int,int> PII;
inline int read()
{
    int x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
inline ll readll()
{
    ll x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
struct node{
    int to,nxt;
} edge[N];
int n,m,e[N][2],d[N],tot,head[N],vis[N];
ll a[N],ans;
void addedge(int u,int v)
{
    edge[++tot].to=v,edge[tot].nxt=head[u],head[u]=tot;
}
int main()
{
    // #define FILEIO
    #ifdef FILEIO
        freopen("in.in","r",stdin);
        freopen("out.out","w",stdout);
    #endif
    n=read(),m=read();
    for(int i=0;i<n;i++) a[i]=read();
    for(int i=1;i<=m;i++)
    {
        int u=read(),v=read();
        e[i][0]=u,e[i][1]=v,d[u]++,d[v]++;
    }
    for(int i=1;i<=m;i++)
    {
        int u=e[i][0],v=e[i][1];
        if(d[u]>d[v] || (d[u]==d[v] && u>v)) swap(u,v);
        addedge(u,v);
    }
    for(int u=0;u<n;u++)
    {
        for(int i=head[u];i;i=edge[i].nxt)
        {
            int v=edge[i].to;
            vis[v]=u;
        }
        for(int i=head[u];i;i=edge[i].nxt)
        {
            int v=edge[i].to;
            for(int j=head[v];j;j=edge[j].nxt)
            {
                int w=edge[j].to;
                if(vis[w]==u) ans=(ans+a[u]*a[v]%mod*a[w]%mod)%mod;
            }
        }
    }
    cout<<ans;
    cerr<<endl<<1e3*clock()/CLOCKS_PER_SEC<<"ms";
    return 0;
}