100 10
87 73
15 71
14 33
1 4
20 80
65 67
36 36
25 4
22 21
7 97
 4 2
3 3
3 4
 5 4
3 3
4 4
5 5
1 2
 4 4
1 2
2 3
3 1
4 4
 4 3
1 1
2 3
3 4
 1000000 1
255765 255765
 4 3
1 2
2 3
4 4
 4 2
1 1
1 2
 3 3
1 1
2 2
3 3
 5 4
1 1
2 3
2 4
2 5
 4 5
1 4
3 4
1 2
2 3
2 4
 4 4
2 3
2 4
3 4
4 4
 10 9
8 10
3 10
2 8
9 3
4 8
1 10
7 9
5 4
7 3
 10 10
1 2
2 3
3 4
4 5
5 1
6 6
7 7
8 8
9 9
10 10
 5 5
1 4
3 4
1 2
2 3
2 4
 3 3
1 2
2 2
3 3
 5 3
1 1
2 2
3 3
 6 12
1 2
1 3
2 3
1 1
2 2
3 3
4 5
5 6
4 6
4 4
5 5
6 6
 4 4
1 2
2 3
1 3
4 4
 5 4
1 2
3 3
4 4
5 5
 7 13
6 7
2 7
3 7
4 3
5 2
1 4
7 7
3 1
5 5
3 3
1 5
2 6
6 6
 2 2
1 1
2 2
 5 5
1 1
2 2
3 3
4 4
5 5
 1 1
1 1
 7 3
1 1
3 3
6 6
 3 3
1 1
2 3
3 3

0 1 0 0 0 0 0 1 0 0 8 6 12 0 8 0 0 0 0 0 57 0 0 0 0 0
#include <bits/stdc++.h>
using namespace std;
const long long M = 1e6 + 11;
long long n, m;
long long flag[M];
long long num, du[M];
long long fa[M];
long long ff(long long x) {
  if (fa[x] == x) return x;
  fa[x] = ff(fa[x]);
  return fa[x];
}
int main() {
  long long i, j, a, b, pa, pb, cnt = 0;
  cin >> n >> m;
  num = 0;
  memset(du, 0, sizeof(du));
  memset(flag, 0, sizeof(flag));
  for (i = 1; i <= m; i++) fa[i] = i;
  for (i = 1; i <= m; i++) {
    scanf("%lld%lld", &a, &b);
    if (a == b) {
      num++;
      flag[a] = 1;
    }
    du[a]++;
    du[b]++;
    pa = ff(a);
    pb = ff(b);
    if (pa != pb) {
      fa[pa] = pb;
      cnt++;
    }
  }
  if (cnt != n - 1) {
    cout << 0 << endl;
    return 0;
  }
  long long tmp, ans = num * (num - 1) / 2;
  for (i = 1; i <= n; i++) {
    tmp = du[i];
    if (flag[i]) tmp -= 2;
    ans += tmp * (tmp - 1) / 2;
  }
  ans += num * (m - num);
  cout << ans << endl;
  return 0;
}
