#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
struct unionfind{
    vector<int> par, sz;
    unionfind() {}
    unionfind(int n):par(n), sz(n, 1){
        for(int i=0; i<n; i++) par[i]=i;
    }
    int find(int x){
        if(par[x]==x) return x;
        return par[x]=find(par[x]);
    }
    void unite(int x, int y){
        x=find(x); y=find(y);
        if(x==y) return;
        if(sz[x]>sz[y]) swap(x, y);
        par[x]=y;
        sz[y]+=sz[x];
    }
    bool same(int x, int y){
        return find(x)==find(y);
    }
    int size(int x){
        return sz[find(x)];
    }
};
const ll MOD=1e9+7;
int main()
{
	int n, m;
	cin>>n>>m;
	int a[200], b[200];
	vector<int> g[20];
	for(int i=0; i<m; i++){
		cin>>a[i]>>b[i];
		a[i]--; b[i]--;
		g[a[i]].push_back(b[i]);
		g[b[i]].push_back(a[i]);
	}
	ll p2[200];
	p2[0]=1;
	for(int i=1; i<=m; i++) p2[i]=p2[i-1]*2%MOD;
	bool myon[1<<15]={};
	int c[1<<15]={};
	for(int i=0; i<(1<<n); i++){
		unionfind uf(n);
		for(int j=0; j<m; j++){
			if(i&(1<<a[j]) && i&(1<<b[j])){
				uf.unite(a[j], b[j]);
				c[i]++;
			}
		}
		if(!(i&1) || !(i&2)) continue;
		if(uf.same(0, 1)) continue;
		bool dame=0;
		for(int j=0; j<n; j++){
			if(i&(1<<j)){
				if(!uf.same(0, j) && !uf.same(1, j)){
					dame=1;
					break;
				}
			}
		}
		if(dame) continue;
		myon[i]=1;
	}
	ll dp[1<<15]={};
	dp[3]=1;
	for(int i=4; i<(1<<n); i++){
		if(!myon[i]) continue;
		dp[i]=p2[c[i]];
		for(int j=i; j>0; j=(j-1)&i){
			if(j==i || !myon[j]) continue;
			dp[i]+=MOD-dp[j]*p2[c[i-j]]%MOD;
			if(dp[i]>=MOD) dp[i]-=MOD;
		}
	}
	ll ans=p2[m];
	for(int i=0; i<(1<<n); i++){
		if(!myon[i]) continue;
		ans+=MOD-dp[i]*p2[c[(1<<n)-1-i]]%MOD;
		if(ans>=MOD) ans-=MOD;
	}
	cout<<ans<<endl;
	return 0;
}