#include <iostream>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
const int N=1e6+9,INF=1e9,mod=1e9+7;
const double eps=1e-5;
typedef pair <int,int> PII;
inline int read()
{
    int x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
inline ll readll()
{
    ll x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
struct node{
    int to,nxt;
} edge[N<<1];
int n,m,tot=1,head[N],dfn[N],low[N],idx,color[N],cnt,siz[N],pw[N],f[N][2],ans,Siz[N];
bool vis[N];
vector <int> g[N];
int add(int x,int y)
{
    x+=y;
    return x>=mod?x-mod:x;
}
void addedge(int u,int v)
{
    edge[++tot].to=v,edge[tot].nxt=head[u],head[u]=tot;
}
void tarjan(int u,int father)
{
    dfn[u]=low[u]=++idx;
    for(int i=head[u];i;i=edge[i].nxt)
    {
        int v=edge[i].to;
        if(dfn[v]==0)
        {
            tarjan(v,u);
            low[u]=min(low[u],low[v]);
            if(low[v]>dfn[u]) vis[i]=vis[i^1]=true;
        }
        else if(v!=father) low[u]=min(low[u],dfn[v]);
    }
}
void dfs(int u)
{
    color[u]=cnt,siz[cnt]++;
    for(int i=head[u];i;i=edge[i].nxt)
    {
        int v=edge[i].to;
        if(color[v]!=0 || vis[i]) continue;
        dfs(v);
    }
}
void dfs1(int u,int fa)
{
    f[u][0]=1,f[u][1]=add(pw[siz[u]]-1,mod),Siz[u]=1;
    for(int i=0;i<g[u].size();i++)
    {
        int v=g[u][i];
        if(v==fa) continue;
        dfs1(v,u);
        Siz[u]+=Siz[v];
        ll f0=0,f1=0;
        f0=1ll*f[u][0]*f[v][0]%mod*2%mod;
        f1=1ll*f[u][1]*f[v][0]%mod*2%mod;
        f1=add(f1,1ll*f[u][0]*f[v][1]%mod);
        f1=add(f1,1ll*f[u][1]*f[v][1]%mod);
        f[u][0]=f0,f[u][1]=f1;
    }
    if(u==1) ans=add(ans,1ll*f[u][1]*pw[m-Siz[u]+1]%mod);
    else ans=add(ans,1ll*f[u][1]*pw[m-Siz[u]]%mod);
}
int main()
{
    // #define FILEIO
    #ifdef FILEIO
        freopen("in.in","r",stdin);
        freopen("out.out","w",stdout);
    #endif
    n=read(),m=read();
    pw[0]=1;
    for(int i=1;i<=m;i++) pw[i]=add(pw[i-1],pw[i-1]);
    for(int i=1;i<=m;i++)
    {
        int u=read(),v=read();
        addedge(u,v),addedge(v,u);
    }
    tarjan(1,0);
    for(int i=1;i<=n;i++)
        if(color[i]==0) ++cnt,dfs(i);
    for(int i=2;i<=tot;i+=2)
    {
        if(vis[i]==false) continue;
        int u=edge[i].to,v=edge[i^1].to;
        g[color[u]].push_back(color[v]),g[color[v]].push_back(color[u]);
    }
    dfs1(1,0);
    cout<<ans;
    cerr<<endl<<1e3*clock()/CLOCKS_PER_SEC<<"ms";
    return 0;
}