#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll MOD = 1e9+7;

void solve() {
    int n, m; cin >> n >> m;
    vector<vector<int>> g(n+1);
    for (int i = 0; i < m; i++) {
        int u, v; cin >> u >> v;
        g[u-1].emplace_back(v);
        g[v].emplace_back(u-1);
    }
    vector<int> depth(n+1, -1);
    ll ans = 1;
    auto dfs = [&](auto &&self, int u, int d = 0) -> void {
        depth[u] = d;
        for (int v : g[u]) {
            if (depth[v] == -1) self(self, v, d^1);
            else if (depth[v] == d) ans = 0;
        }
    };
    for (int i = 0; i <= n; i++) {
        if (depth[i] == -1) {
            if (i != 0) {
                ans *= 2;
                ans %= MOD;
            }
            dfs(dfs, i);
        }
    }
    cout << ans << "\n";
}

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