// UUID: 3e4cc980-69b2-42fb-af3b-da63de8ec683
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int MOD = 1e9+7;
vector<vector<int>> graf;
vector<int> paritas;
vector<bool> volt;
vector<int> parent;
bool impossible = false;

void dfs(int csucs, int prev_parity){
	if(prev_parity == 1){
		paritas[csucs] = 2;
	}
	else{
		paritas[csucs] = 1;
	}
	volt[csucs] = true;
	for(int x: graf[csucs]){
		if(x == parent[csucs]){
			continue;
		}
		if(volt[x]){
			if(paritas[csucs] == paritas[x]){
				impossible = true;
			}
		}
		else{
			parent[x] = csucs;
			dfs(x, paritas[csucs]);
		}
	}
}

ll hatvanyoz(int base, int exponent){
	ll hatvany = base;
	ll x = 1;
	for(int j = 0; j <= 30; j++){
		if((exponent >> j) & 1){
			x *= hatvany;
			x %= MOD;
		}
		hatvany *= hatvany;
		hatvany %= MOD;
	}
	return x;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t;
	cin >> t;
	for(int i = 0; i < t; i++){
		int n, k;
		cin >> n >> k;
		graf.clear();
		graf.resize(n+1);
		paritas.clear();
		paritas.resize(n+1, 0);
		volt.clear();
		volt.resize(n+1, false);
		parent.clear();
		parent.resize(n+1, -1);
		for(int j = 0; j < k; j++){
			int a, b;
			cin >> a >> b;
			graf[a-1].push_back(b);
			graf[b].push_back(a-1);
		}
		int component = 0;
		for(int j = 0; j <= n; j++){
			if(!volt[j]){
				dfs(j, 1);
				component++;
			}
		}
		if(impossible){
			cout << 0 << "\n";
			continue;
		}
		cout << hatvanyoz(2, component-1) << "\n";
	}
}