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
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.StringTokenizer;

public class B407 {
	static int V, E;
	public static void main(String[] args) {
		FS scan = new FS(System.in);
		
		V = scan.nextInt();
		E= scan.nextInt();
		int[] count = new int[V];
		int[][] edges = new int[2][E];
		int[][] adj = new int[V][];
		for(int i=0;i<E;i++){
			count[edges[0][i]=scan.nextInt()-1]++;
			if(edges[0][i]!=edges[1][i])count[edges[1][i]=scan.nextInt()-1]++;
		}
		for(int i=0;i<V;i++){
			adj[i] = new int[count[i]];
		}
		Arrays.fill(count, 0);
		for(int i=0;i<E;i++){
			adj[edges[0][i]][count[edges[0][i]]++] = edges[1][i];
			if(edges[0][i]!=edges[1][i])adj[edges[1][i]][count[edges[1][i]]++] = edges[0][i];
		}
		
		boolean[] seen = new boolean[V], hasSelf = new boolean[V];
		ArrayDeque<Integer> q = new ArrayDeque<>();
		seen[0] = true;
		q.add(0);
		
		int self = 0;
		while(!q.isEmpty()){
			int node = q.poll();
			for(int v : adj[node]){
				if(v==node){
					hasSelf[v]=true;
					self++;
				}
				if(seen[v])continue;
				seen[v] = true;
				q.add(v);
			}
		}
		boolean valid = true;
		for(int i=0;i<E;i++)if(!seen[edges[0][i]]||!seen[edges[1][i]])valid=false;
		
		long sol = 0;
		for(int i=0;i<V;i++){
			if(hasSelf[i])sol+=E-1;
			long x = adj[i].length + ((hasSelf[i])?-1:0);
			sol+=x*(x-1)/2;
		}
		
		System.out.println(valid?sol:0);
		
	}
	
	
	public static class FS {
		BufferedReader br;
		StringTokenizer st;
	
		public String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception e) {
				}
			}
			return st.nextToken();
		}
	
		public FS(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}
	
		int nextInt() {
			return Integer.parseInt(next());
		}
	
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}
