// UUID: 9b6e8d9d-48c3-4d3b-890d-c5ed23144708
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll mod = 1e9 + 7;
const int maxn = 2e4 + 3;
ll pows[maxn];
vector<vector<int>> g;
vector<int> volt;

void count_pows() {
	pows[0] = 1;
	for (int i = 1; i < maxn; i ++) pows[i] = (2 * pows[i - 1]) % mod;
}

bool dfs(int u, int val) {
	volt[u] = val;
	int val2 = 3 - val;
	for (int v : g[u]) {
		if (volt[v] == 0) {
			if (!dfs(v, val2)) return false;
		}
		if (volt[v] == val) return false;
	}
	return true;
}

void solve() {
	// fill(g.begin(), g.end(), vector<int>());
	// fill(volt.begin(), volt.end(), 0);
	int n, m; cin >> n >> m;
	volt.assign(n+1, false);
	g.assign(n+1, {});
	for (int i = 0; i < m; i ++) {
		int u, v; cin >> u >> v;
		g[u - 1].push_back(v); g[v].push_back(u - 1);
	}
	int comps = 0;
	for (int i = 0; i <= n; i ++) {
		if (volt[i] == 0) {
			comps ++;
			if (!dfs(i, 1)) {
				cout << 0 << "\n"; return;
			}
		}
	}
	cout << pows[comps - 1] << "\n";
	return;
}

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