#include <bits/stdc++.h>
using namespace std;
#define N 200005
#define MOD 1000000007
#define ull unsigned long long
#define pb push_back
mt19937_64 rand1(0);
int n,m,r,s,s1;ull w1[N],w[N];bool vs[N];map<ull,int> z;
struct Edge {int v,id;};vector<Edge> e[N];
int qPow(int x,int y)
{int res=1;for(;y;y/=2,x=1ll*x*x%MOD) if(y&1) res=1ll*res*x%MOD;return res;}
void dfs(int u,int f,int fe)
{
	vs[u]=1;
	for(auto [v,id]:e[u]) if(id!=fe)
	{
		if(!vs[v]) dfs(v,u,id),w1[u]^=w1[v];
		else if(!w[id]) ++r,w[id]=rand1(),w1[u]^=w[id],w1[v]^=w[id];
	}w[fe]=w1[u];
}
int main()
{
	while(~scanf("%d %d",&n,&m))
	{
		r=s=s1=0;fill(w1+1,w1+n+1,0);fill(w+1,w+m+1,0);fill(vs+1,vs+n+1,0);
		z.clear();for(int i=1;i<=n;++i) e[i].clear();
		for(int i=1,u,v;i<=m;++i)
			scanf("%d %d",&u,&v),e[u].pb((Edge) {v,i}),e[v].pb((Edge) {u,i});
		for(int i=1;i<=n;++i) if(!vs[i]) dfs(i,0,0);
		for(int i=1;i<=m;++i) if(w[i]) ++z[w[i]];
		for(auto [x,y]:z) s+=y,s1=(s1+1ll*y*y)%MOD;
		printf("%lld\n",(1ll*s*s+s1)%MOD*qPow(2,MOD+r-3)%MOD);
	}return 0;
}