#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<random>
#include<unordered_map>
#include<queue>
#define fi first
#define se second
using namespace std;
const int N=300010,M=500010;
typedef long long ll;
typedef unsigned long long ull;
typedef unordered_map<ull,ll> umap;
typedef priority_queue<pair<int,int>> pq;
mt19937_64 Rnd(1234);
struct node{
    int x,y,c;
}r[M];
int f[N],n,m,ms;ll ans;
ull h[M];
bool cut[M];
ll C2(int x){return 1ll*x*(x-1)/2;}
int find(int x){return x==f[x]?f[x]:(f[x]=find(f[x]));}
void reset()
{
    int m0=m,n0=n;n=m=ms=0;static int id[N];
    for(int i=1;i<=n0;i++) f[i]=i,id[i]=0;
    for(int i=1;i<=m0;i++) if(cut[i]) f[find(r[i].x)]=find(r[i].y);
    for(int i=1;i<=n0;i++) if(i==f[i] && !id[i]) id[i]=++n;
    for(int i=1;i<=m0;i++)
    {
        r[i].x=id[find(r[i].x)],r[i].y=id[find(r[i].y)];
        if(r[i].x!=r[i].y) r[++m]=r[i],ms+=r[i].c;
    }
    for(int i=1;i<=m0;i++) cut[i]=false;
}
vector<pair<int,int>>g[N];bool on[M];int dep[N],pre[N],dfn[N];
namespace rand_road{
    bool vis[N];
    ull d[N];int idx;
    void dfs(int u)
    {
        vis[u]=true;dfn[u]=++idx;
        for(auto [v,id]:g[u]) if(!vis[v]) pre[v]=id,dep[v]=dep[u]+1,dfs(v),on[id]=true;
    }
    void dfs2(int u){for(auto [v,id]:g[u]) dfs2(v),h[id]=d[v],d[u]^=d[v];}
    void init()
    {
        for(int i=1;i<=n;i++) d[i]=dfn[i]=dep[i]=0,vis[i]=false,g[i].clear();
        for(int i=1;i<=m;i++) on[i]=false,h[i]=0;
        idx=0;
        for(int i=1;i<=m;i++) g[r[i].x].push_back({r[i].y,i}),g[r[i].y].push_back({r[i].x,i});
        dfs(1);
        for(int i=1;i<=n;i++) g[i].clear();
        for(int i=1;i<=m;i++)
            if(on[i])
            {
                if(dep[r[i].x]<dep[r[i].y]) g[r[i].x].push_back({r[i].y,i});
                else g[r[i].y].push_back({r[i].x,i});
            }
            else h[i]=Rnd(),d[r[i].x]^=h[i],d[r[i].y]^=h[i];
        dfs2(1);
    }
}
void solve0()
{
    rand_road::init();
    umap mp;
    for(int i=1;i<=m;i++) if(h[i]==0) --ms,ans+=C2(ms),cut[i]=true;
    else mp[h[i]]++;
    for(int i=1;i<=m;i++) if(!mp.count(h[i])) cut[i]=true;
    else ans+=C2(r[i].c=mp[h[i]])*(ms-r[i].c)+1ll*r[i].c*(r[i].c-1)*(r[i].c-2)/6,mp.erase(h[i]);
    reset();
}
int s0[N],s1[N];ll s2[N];
void add_l(int l,int r,int w)
{
    if(dep[l]>dep[r]) swap(l,r);
    s0[r]++,s0[l]--,s1[r]+=w,s1[l]-=w,s2[r]+=1ll*w*w,s2[l]-=1ll*w*w;
}
void dfs1(int u)
{
    for(auto [v,id]:g[u]) dfs1(v),s0[u]+=s0[v],s1[u]+=s1[v],s2[u]+=s2[v];
    if(s0[u]==2) ans+=r[pre[u]].c*((1ll*s1[u]*s1[u]-s2[u])/2);
}
int up[N],dn[N];
void clear(pq &x){while(!x.empty()) x.pop();}
pq rt[N],rt2[N];umap mp[N],mp0;
void merge(umap &x,umap &y)
{
    if(x.size()<y.size()) x.swap(y);
    for(auto v:y) x[v.fi]+=v.se;
    y.clear();
}
void merge(pq &x,pq &y)
{
    if(x.size()<y.size()) x.swap(y);
    while(!y.empty()) x.push(y.top()),y.pop();
}
void pop(pq &x,int d){while(!x.empty() && dep[r[x.top().se].y]>=d) x.pop();}
void dfs2(int u)
{
    for(auto [v,id]:g[u]) dfs2(v),merge(rt[u],rt[v]);
    pop(rt[u],dep[u]);
    if(!rt[u].empty()) up[u]=rt[u].top().se;
}
void check(umap &a,int x,int y){if(x && y && a.count(h[x]^h[y])) ans+=r[x].c*r[y].c*a[h[x]^h[y]];}
void dfs3(int u)
{
    check(mp0,pre[u],up[u]);
    if(pre[u]) mp0[h[pre[u]]]+=r[pre[u]].c;
    for(auto [v,id]:g[u]) dfs3(v);
    if(pre[u]) mp0[h[pre[u]]]-=r[pre[u]].c;
}
void dfs4(int u)
{
    for(auto [v,id]:g[u]) dfs4(v),merge(rt[u],rt[v]),merge(rt2[u],rt2[v]),merge(mp[u],mp[v]);
    pop(rt[u],dep[u]),pop(rt2[u],dep[u]);
    if(pre[u])
    {
        if(!rt[u].empty()) check(mp[u],pre[u],rt[u].top().se);
        if(!rt2[u].empty()) check(mp[u],pre[u],rt2[u].top().se);
        mp[u][h[pre[u]]]+=r[pre[u]].c;
    }
}
void solve()
{
    while(n>1)
    {
        rand_road::init();
        for(int i=1;i<=n;i++) s0[i]=s1[i]=s2[i]=0;
        for(int i=1;i<=m;i++) if(dep[r[i].x]<dep[r[i].y]) swap(r[i].x,r[i].y);
        for(int i=1;i<=m;i++) if(!on[i]) add_l(r[i].x,r[i].y,r[i].c);
        dfs1(1);
        for(int i=1;i<=n;i++) clear(rt[i]);mp0.clear();
        for(int i=1;i<=m;i++) if(!on[i]) rt[r[i].x].push({dep[r[i].y],i});
        dfs2(1),dfs3(1);
        for(int i=1;i<=n;i++) clear(rt[i]),clear(rt2[i]),mp[i].clear();
        for(int i=1;i<=m;i++) if(!on[i]) rt[r[i].x].push({dfn[r[i].x],i}),rt2[r[i].x].push({-dfn[r[i].x],i});
        dfs4(1);
        for(int i=1;i<=m;i++) if(!on[i]) cut[i]=true;
        reset();
    }
}
int main()
{
    scanf("%d%d",&n,&m),ms=m;
    for(int i=1;i<=n;i++) f[i]=i;
    for(int i=1;i<=m;i++) scanf("%d%d",&r[i].x,&r[i].y),r[i].c=1;
    solve0();
    // cerr<<n<<" "<<m<<endl;
    // for(int i=1;i<=m;i++) printf("%d %d\n",r[i].x,r[i].y);
    solve();
    printf("%lld\n",ans);
    return 0;
}

/*#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<random>
#include<unordered_map>
#include<queue>
#define fi first
#define se second
using namespace std;
const int N=300010,M=500010;
typedef long long ll;
typedef unsigned long long ull;
typedef unordered_map<ull,ll> umap;
typedef priority_queue<pair<int,int>> pq;
mt19937_64 Rnd(1234);
struct node{
    int x,y,c;
}r[M];
int f[N],n,m,ms;ll ans;
ull h[M];
bool cut[M];
ll C2(int x){return 1ll*x*(x-1)/2;}
int find(int x){return x==f[x]?f[x]:(f[x]=find(f[x]));}
void reset()
{
    int m0=m,n0=n;n=m=ms=0;static int id[N];
    for(int i=1;i<=n0;i++) f[i]=i,id[i]=0;
    for(int i=1;i<=m0;i++) if(cut[i]) f[find(r[i].x)]=find(r[i].y);
        for(int i=1;i<=m;i++) g[r[i].x].push_back({r[i].y,i}),g[r[i].y].push_back({r[i].x,i});
        dfs(1);
        for(int i=1;i<=n;i++) g[i].clear();
        for(int i=1;i<=m;i++)
            if(on[i])
            {
                if(dep[r[i].x]<dep[r[i].y]) g[r[i].x].push_back({r[i].y,i});
                else g[r[i].y].push_back({r[i].x,i});
            }
            else h[i]=Rnd(),d[r[i].x]^=h[i],d[r[i].y]^=h[i];
        dfs2(1);
    }
}
void solve0()
{
    rand_road::init();
    umap mp;
    for(int i=1;i<=m;i++) if(h[i]==0) --ms,ans+=C2(ms),cut[i]=true;
    else mp[h[i]]++;
    for(int i=1;i<=m;i++) if(!mp.count(h[i])) cut[i]=true;
    else ans+=C2(r[i].c=mp[h[i]])*(ms-r[i].c)+1ll*r[i].c*(r[i].c-1)*(r[i].c-2)/6,mp.erase(h[i]);
    reset();
}
int s0[N],s1[N];ll s2[N];
void add_l(int l,int r,int w)
{
    if(dep[l]>dep[r]) swap(l,r);
    s0[r]++,s0[l]--,s1[r]+=w,s1[l]-=w,s2[r]+=1ll*w*w,s2[l]-=1ll*w*w;
}
void dfs1(int u)
{
    for(auto [v,id]:g[u]) dfs1(v),s0[u]+=s0[v],s1[u]+=s1[v],s2[u]+=s2[v];
    if(s0[u]==2) ans+=r[pre[u]].c*((1ll*s1[u]*s1[u]-s2[u])/2);
}
int up[N],dn[N];
void clear(pq &x){while(!x.empty()) x.pop();}
pq rt[N],rt2[N];umap mp[N],mp0;
void merge(umap &x,umap &y)
{
    if(x.size()<y.size()) x.swap(y);
    for(auto v:y) x[v.fi]+=v.se;
    y.clear();
}
void merge(pq &x,pq &y)
{
    if(x.size()<y.size()) x.swap(y);
    while(!y.empty()) x.push(y.top()),y.pop();
}
void pop(pq &x,int d){while(!x.empty() && dep[r[x.top().se].y]>=d) x.pop();}
void dfs2(int u)
{
    for(auto [v,id]:g[u]) dfs2(v),merge(rt[u],rt[v]);
    pop(rt[u],dep[u]);
    if(!rt[u].empty()) up[u]=rt[u].top().se;
}
void check(umap &a,int x,int y){if(x && y && a.count(h[x]^h[y])) ans+=r[x].c*r[y].c*a[h[x]^h[y]];}
void dfs3(int u)
{
    check(mp0,pre[u],up[u]);
    if(pre[u]) mp0[h[pre[u]]]+=r[pre[u]].c;
    for(auto [v,id]:g[u]) dfs3(v);
    if(pre[u]) mp0[h[pre[u]]]-=r[pre[u]].c;
}
void dfs4(int u)
{
    for(auto [v,id]:g[u]) dfs4(v),merge(rt[u],rt[v]),merge(rt2[u],rt2[v]),merge(mp[u],mp[v]);
    pop(rt[u],dep[u]),pop(rt2[u],dep[u]);
    if(pre[u])
    {
        if(!rt[u].empty()) check(mp[u],pre[u],rt[u].top().se);
        if(!rt2[u].empty()) check(mp[u],pre[u],rt2[u].top().se);
        mp[u][h[pre[u]]]+=r[pre[u]].c;
    }
}
void solve()
{
    while(n>1)
    {
        rand_road::init();
        for(int i=1;i<=n;i++) s0[i]=s1[i]=s2[i]=0;
        for(int i=1;i<=m;i++) if(dep[r[i].x]<dep[r[i].y]) swap(r[i].x,r[i].y);
        for(int i=1;i<=m;i++) if(!on[i]) add_l(r[i].x,r[i].y,r[i].c);
        dfs1(1);
        for(int i=1;i<=n;i++) clear(rt[i]);mp0.clear();
        for(int i=1;i<=m;i++) if(!on[i]) rt[r[i].x].push({dep[r[i].y],i});
        dfs2(1),dfs3(1);
        for(int i=1;i<=n;i++) clear(rt[i]),clear(rt2[i]),mp[i].clear();
        for(int i=1;i<=m;i++) if(!on[i]) rt[r[i].x].push({dfn[r[i].x],i}),rt2[r[i].x].push({-dfn[r[i].x],i});
        dfs4(1);
        for(int i=1;i<=m;i++) if(!on[i]) cut[i]=true;
        reset();
    }
}
int main()
{
    scanf("%d%d",&n,&m),ms=m;
    for(int i=1;i<=n;i++) f[i]=i;
    for(int i=1;i<=m;i++) scanf("%d%d",&r[i].x,&r[i].y),r[i].c=1;
    solve0();
    // cerr<<n<<" "<<m<<endl;
    // for(int i=1;i<=m;i++) printf("%d %d\n",r[i].x,r[i].y);
    solve();
    printf("%lld\n",ans);
    return 0;
}
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<random>
#include<unordered_map>
#include<queue>
#define fi first
#define se second
using namespace std;
const int N=300010,M=500010;
typedef long long ll;
typedef unsigned long long ull;
typedef unordered_map<ull,ll> umap;
typedef priority_queue<pair<int,int>> pq;
mt19937_64 Rnd(1234);
struct node{
    int x,y,c;
}r[M];
int f[N],n,m,ms;ll ans;
ull h[M];
bool cut[M];
ll C2(int x){return 1ll*x*(x-1)/2;}
int find(int x){return x==f[x]?f[x]:(f[x]=find(f[x]));}
void reset()
{
    int m0=m,n0=n;n=m=ms=0;static int id[N];
    for(int i=1;i<=n0;i++) f[i]=i,id[i]=0;
    for(int i=1;i<=m0;i++) if(cut[i]) f[find(r[i].x)]=find(r[i].y);
    for(int i=1;i<=n0;i++) if(i==f[i] && !id[i]) id[i]=++n;
    for(int i=1;i<=m0;i++)
    {
        r[i].x=id[find(r[i].x)],r[i].y=id[find(r[i].y)];
        if(r[i].x!=r[i].y) r[++m]=r[i],ms+=r[i].c;
    }
    for(int i=1;i<=m0;i++) cut[i]=false;
}
vector<pair<int,int>>g[N];bool on[M];int dep[N],pre[N],dfn[N];
namespace rand_road{
    bool vis[N];
    ull d[N];int idx;
    void dfs(int u)
    {
        vis[u]=true;dfn[u]=++idx;
        for(auto [v,id]:g[u]) if(!vis[v]) pre[v]=id,dep[v]=dep[u]+1,dfs(v),on[id]=true;
    }
    void dfs2(int u){for(auto [v,id]:g[u]) dfs2(v),h[id]=d[v],d[u]^=d[v];}
    void init()
    {
        for(int i=1;i<=n;i++) d[i]=dfn[i]=dep[i]=0,vis[i]=false,g[i].clear();
        for(int i=1;i<=m;i++) on[i]=false,h[i]=0;
        idx=0;
        for(int i=1;i<=m;i++) g[r[i].x].push_back({r[i].y,i}),g[r[i].y].push_back({r[i].x,i});
        dfs(1);
        for(int i=1;i<=n;i++) g[i].clear();
        for(int i=1;i<=m;i++)
            if(on[i])
            {
                if(dep[r[i].x]<dep[r[i].y]) g[r[i].x].push_back({r[i].y,i});
                else g[r[i].y].push_back({r[i].x,i});
            }
            else h[i]=Rnd(),d[r[i].x]^=h[i],d[r[i].y]^=h[i];
        dfs2(1);
    }
}
void solve0()
{
    rand_road::init();
    umap mp;
    for(int i=1;i<=m;i++) if(h[i]==0) --ms,ans+=C2(ms),cut[i]=true;
    else mp[h[i]]++;
    for(int i=1;i<=m;i++) if(!mp.count(h[i])) cut[i]=true;
    else ans+=C2(r[i].c=mp[h[i]])*(ms-r[i].c)+1ll*r[i].c*(r[i].c-1)*(r[i].c-2)/6,mp.erase(h[i]);
    reset();
}
int s0[N],s1[N];ll s2[N];
void add_l(int l,int r,int w)
{
    if(dep[l]>dep[r]) swap(l,r);
    s0[r]++,s0[l]--,s1[r]+=w,s1[l]-=w,s2[r]+=1ll*w*w,s2[l]-=1ll*w*w;
}
void dfs1(int u)
{
    for(auto [v,id]:g[u]) dfs1(v),s0[u]+=s0[v],s1[u]+=s1[v],s2[u]+=s2[v];
    if(s0[u]==2) ans+=r[pre[u]].c*((1ll*s1[u]*s1[u]-s2[u])/2);
}
int up[N],dn[N];
void clear(pq &x){while(!x.empty()) x.pop();}
pq rt[N],rt2[N];umap mp[N],mp0;
void merge(umap &x,umap &y)
{
    if(x.size()<y.size()) x.swap(y);
    for(auto v:y) x[v.fi]+=v.se;
    y.clear();
}
void merge(pq &x,pq &y)
{
    if(x.size()<y.size()) x.swap(y);
    while(!y.empty()) x.push(y.top()),y.pop();
}
void pop(pq &x,int d){while(!x.empty() && dep[r[x.top().se].y]>=d) x.pop();}
void dfs2(int u)
{
    for(auto [v,id]:g[u]) dfs2(v),merge(rt[u],rt[v]);
    pop(rt[u],dep[u]);
    if(!rt[u].empty()) up[u]=rt[u].top().se;
}
void check(umap &a,int x,int y){if(x && y && a.count(h[x]^h[y])) ans+=r[x].c*r[y].c*a[h[x]^h[y]];}
void dfs3(int u)
{
    check(mp0,pre[u],up[u]);
    if(pre[u]) mp0[h[pre[u]]]+=r[pre[u]].c;
    for(auto [v,id]:g[u]) dfs3(v);
    if(pre[u]) mp0[h[pre[u]]]-=r[pre[u]].c;
}
void dfs4(int u)
{
    for(auto [v,id]:g[u]) dfs4(v),merge(rt[u],rt[v]),merge(rt2[u],rt2[v]),merge(mp[u],mp[v]);
    pop(rt[u],dep[u]),pop(rt2[u],dep[u]);
    if(pre[u])
    {
        if(!rt[u].empty()) check(mp[u],pre[u],rt[u].top().se);
        if(!rt2[u].empty()) check(mp[u],pre[u],rt2[u].top().se);
        mp[u][h[pre[u]]]+=r[pre[u]].c;
    }
}
void solve()
{
    while(n>1)
    {
        rand_road::init();
        for(int i=1;i<=n;i++) s0[i]=s1[i]=s2[i]=0;
        for(int i=1;i<=m;i++) if(dep[r[i].x]<dep[r[i].y]) swap(r[i].x,r[i].y);
        for(int i=1;i<=m;i++) if(!on[i]) add_l(r[i].x,r[i].y,r[i].c);
        dfs1(1);
        for(int i=1;i<=n;i++) clear(rt[i]);mp0.clear();
        for(int i=1;i<=m;i++) if(!on[i]) rt[r[i].x].push({dep[r[i].y],i});
        dfs2(1),dfs3(1);
        for(int i=1;i<=n;i++) clear(rt[i]),clear(rt2[i]),mp[i].clear();
        for(int i=1;i<=m;i++) if(!on[i]) rt[r[i].x].push({dfn[r[i].x],i}),rt2[r[i].x].push({-dfn[r[i].x],i});
        dfs4(1);
        for(int i=1;i<=m;i++) if(!on[i]) cut[i]=true;
        reset();
    }
}
int main()
{
    scanf("%d%d",&n,&m),ms=m;
    for(int i=1;i<=n;i++) f[i]=i;
    for(int i=1;i<=m;i++) scanf("%d%d",&r[i].x,&r[i].y),r[i].c=1;
    solve0();
    // cerr<<n<<" "<<m<<endl;
    // for(int i=1;i<=m;i++) printf("%d %d\n",r[i].x,r[i].y);
    solve();
    printf("%lld\n",ans);
    return 0;
}
*/