// UUID: 185ef595-9265-408f-896d-296d88ee1168
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<bool> vis;
vector<int> parity;
vector<vector<int>> g;
vector<array<int,2>> iv;

void dfs(int u,int p){
	vis[u]=1; parity[u]=p;
	for (int v:g[u]){
		if (!vis[v]) dfs(v,1-p);
	}
}

ll fastPow(ll a, ll b, ll mod = 1e9+7){
	if (b == 0) return 1;
	if (b == 1) return a;
	ll res = fastPow(a, b / 2);
	if (b & 1) return res * res % mod * a % mod;
	return res * res % mod;
}

int main() {
	int t; cin >> t;
	for (int j=0;j<t;j++){
		int n,k; cin >> n >> k;
		vis.assign(n + 1,0); g.assign(n + 1,vector<int>()); parity.assign(n + 1,0); iv.clear();
		for (int i=0;i<k;i++){
			int u,v; cin >> u >> v;
			g[u-1].push_back(v);
			g[v].push_back(u-1);
			iv.push_back({u - 1,v});
		}
		int c=0;
		for (int i=0;i<=n;i++){
			if (!vis[i]) {dfs(i,0); c++;}
		}
		bool jo = true;
		for (auto i:iv){
			if (parity[i[0]]==parity[i[1]]){
				cout << 0 << '\n'; jo = false;
				break;
			}
		}
		if (!jo) continue;
		cout << fastPow(2, c-1) << '\n';
	}
}