// UUID: ca942818-7ffb-45a0-b9cf-4693b3d370fd
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<int,int>;

vector<vector<int>> vec;
vector<bool> szinek, check;
ll ki=0;
bool kiloni=false;

ll hatvany(ll a, ll b, ll mod=1000000007)
{
	if(b==0)
		return 1;
	ll c=hatvany(a, b/2);
	if(b&1)
		return (c*c*a)%mod;
	return (c*c)%mod;
}

void dfs(int x)
{
	check[x]=true;
	for(auto& z:vec[x])
	{
		if(kiloni)
			return;
		if(check[z] && szinek[z]==szinek[x])
		{
			ki=0;
			kiloni=true;
			return;
		}
		if(!check[z])
		{
			szinek[z]=!szinek[x];
			dfs(z);
		}
	}
}

void solve()
{
	int n,k; cin >> n >> k;
	vec.assign(n+1, {});
	check.assign(n+1,false);
	szinek.assign(n+1,false);
	for(int i=0; i<k; i++)
	{
		int a,b; cin >> a >> b;
		vec[a-1].push_back(b);
		vec[b].push_back(a-1);
	}
	ll komponensek=0;
	for(int i=0; i<n+1; i++)
	{
		if(!check[i])
		{
			dfs(i);
			//cerr << i << "\n";
			komponensek++;
		}
	}
	if(kiloni)
	{
		cout << "0\n";
		return;
	}
	cout << hatvany(2, komponensek-1) << "\n";
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int t; cin >> t;
	while(t--)
		solve();
}