#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;
ll inf=1e18;
const int N=1e6+100,L=21,bs=701;
int A[N],B[N],C[N],D[N],E[N],n,m,k,q,vis[N],bk[N],h[N],is[N],iss[N];
vector<int>g[N],vec;
ll ans;
ll dp1[N],dp2[N],dp3[N],pre[N],dp[N];
void DFS(int v,int p=0){
vis[v]=1;bk[v]=h[v];
vector<int>vec;
for(int u:g[v]){
if(vis[u]==1 && u!=p){
bk[v]=min(bk[v],bk[u]);
iss[u]=1;
is[v]=1;
}
else if(vis[u]==0){
vec.pb(u);
h[u]=h[v]+1;
DFS(u,v);
bk[v]=min(bk[v],bk[u]);
}
}
g[v]=vec;
vis[v]=2;
}
void dfs(int v){
dp[v]=dp1[v]=dp2[v]=dp3[v]=1;
for(int u:g[v]){
dfs(u);
dp[v]=dp[v]*(dp[u]+1)%mod;
if(is[u]==0){
dp1[v]=dp1[v]*(dp1[u]+1)%mod;
}
if(bk[u]==h[u]){
dp2[v]=dp2[v]*(dp1[u]+1)%mod;
dp3[v]=dp3[v]*(dp1[u]+1)%mod;
}
else{
dp2[v]=dp2[v]*dp2[u]%mod;
dp3[v]=(dp3[v]*(pre[u]+dp3[u]))%mod;
pre[v]+=pre[u]+dp2[u];
}
}
if(iss[v]){
dp1[v]+=dp3[v];
dp[v]=dp1[v];
}
ans+=dp[v];
if(h[v]==bk[v]){
dp2[v]=dp3[v]=pre[v]=0;
}
if(is[v])dp3[v]=0;
dp[v]%=mod;
dp1[v]%=mod;
dp2[v]%=mod;
dp3[v]%=mod;
pre[v]%=mod;
}
int main(){
fast_io
cin>>n>>m;
for1(m){
int u,v;cin>>u>>v;
g[u].pb(v);
g[v].pb(u);
}
DFS(1);
dfs(1);
cout<<ans%mod<<endl;
}
