#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
ll ans = 0, sub[N];
vector<int> E[N];
void dfs(int nd, int pr){
for (auto i : E[nd]){
if (i != pr){
dfs(i,nd);
sub[nd] += sub[i];
}
}
ans += sub[nd]*(sub[nd]-1)/2;
sub[nd]++;
}
int main ()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
while(m--){
int u, v;
cin >> u >> v;
E[u].pb(v);
E[v].pb(u);
}
dfs(1, 0);
cout << ans*2 << '\n';
}
