#include<cstdio>

#include<cmath>

#include<algorithm>

#include<cstring>

#include<vector>

#define ull unsigned long long

#define ll long long

#define inf 20021225

#define N 400010

#define it vector<int>::iterator

using namespace std;

int sz[N],deg[N],n,m;

vector<ull> sum[N];

vector<int> ed[N];

struct edge{int to,lt;}e[N];

int in[N],cnt; int vis[N];

void add(int x,int y){e[++cnt].to=y;e[cnt].lt=in[x];in[x]=cnt;}

void go(int x){for(int i=in[x];i;i=e[i].lt) vis[e[i].to]=x;}

ull calc(int x){if(x<)  return ; return (ll)x*(x-)/;}

ull up(int l,int r){if(l>r)  return ; return (ll)(r+l)*(r-l+)/;}

int main()

{

    scanf("%d%d",&n,&m); ull A,B,C,res=;

    scanf("%llu%llu%llu",&A,&B,&C); int x,y;

    //scanf("%I64d%I64d%I64d",&A,&B,&C); int x,y;

    for(int i=;i<=m;i++)

    {

        scanf("%d%d",&x,&y);

        ed[x].push_back(y);

        ed[y].push_back(x);

    }

    //ull edg=(ull)n*(n-1)>>1;

    //at least 0

    for(int i=;i<n;i++)

        res+=A*i*calc(n-i-),

        res+=B*i*i*(n-i-),

        res+=C*i*calc(i),

        sort(ed[i].begin(),ed[i].end()),

        sum[i].push_back();

    //printf("%llu\n",res);

    for(x=;x<n;x++) for(it i=ed[x].begin();i!=ed[x].end();i++)

        sz[x]=(*i)>x?sz[x]:sz[x]+,++deg[x],sum[x].push_back(sum[x][deg[x]-]+(*i));

    //at least 1

    for(x=;x<n;x++) for(it i=ed[x].begin();i!=ed[x].end();i++)

        if((*i)<x)

        {

            y=*i;

            //x as B

            res-=B*x*(n-x-);

            res-=A*y*(n-x-);

            res-=C*up(x+,n-);

            //x as C

            res-=A*up(,y-);

            res-=B*y*y;

            res-=B*up(y+,x-);

            res-=A*y*(x-y->?x-y-:);

            res-=C*x*(x-);

        }

    //printf("%llu\n",res);

    //at least 2

    //int dig;

    //printf("%llu\n",res);

    for(x=;x<n;x++) for(int i=;i<=deg[x];i++)

    {

        //printf("%d %llu\n",x,sum[x][i]);

        //x has 2 edges out

        y=ed[x][i-];

        if(y>x)

        {

            //x is A

            res+=A*x*(deg[x]-i); res+=B*y*(deg[x]-i);

            res+=C*(sum[x][deg[x]]-sum[x][i]);

            //printf("%d %d %llu\n",x,y,res);

        }

        else// if(y<x)

        {

            //x is B

            res+=B*x*(deg[x]-sz[x]); res+=A*y*(deg[x]-sz[x]);

            res+=C*(sum[x][deg[x]]-sum[x][sz[x]]);

            //x is C

            res+=C*x*(i-); res+=B*y*(i-);

            res+=A*sum[x][i-];

        }

    }

    //printf("%llu\n",res);

    //at least 3

    /**for(int i=1;i<=n;i++)

    {

        if(deg[i]<=top)

        {

            for(int j=0;j<deg[i];j++)

            {

                for(int k=j+1;k<deg[i];k++)

                {

                    x=i; y=ed[x][j]; z=ed[x][k];

                    if(x>y)  swap(x,y);

                    if(x>z)  swap(x,z);

                    res-=A*x+B*y+C*z;

                }

            }

        }

        else    big.push_back(i);

    }*/

    for(x=;x<n;x++) for(int i=;i<deg[x];i++)

        if(deg[ed[x][i]]<deg[x] || (deg[ed[x][i]]==deg[x]&&ed[x][i]<x))

            add(x,ed[x][i]);

    memset(vis,-,sizeof(vis));

    for(x=;x<n;x++)

    {

        go(x);

        for(int i=in[x];i;i=e[i].lt)

        {

            y=e[i].to;

            for(int j=in[y];j;j=e[j].lt)

            {

                if(vis[e[j].to]==x)

                {

                    int xx=x,yy=y,zz=e[j].to;

                    if(xx>yy)    swap(xx,yy);

                    if(xx>zz)    swap(xx,zz);

                    if(yy>zz)    swap(yy,zz);

                    res-=A*xx+B*yy+C*zz;

                }

            }

        }

    }

    printf("%llu\n",res);

    //printf("%I64u\n",res);

    return ;

}

/**

4 1

2 3 4

1 0

*/