// UUID: a5740b89-b3d0-4715-877f-fa3980781067
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;

int e(int n){
    if (n == 0) return 1;
    else return (2*e(n-1)) % MOD;
}

bool isbiparte(int node, const vector<vector<int>>& adj, vector<int>& visited){
    bool f = true;
    for (int i : adj[node]) {
        if (visited[i] != 0) {
            if (visited[i] == visited[node]) return false;
            continue;
        }
        visited[i] = visited[node] % 2 + 1;
        f = (f && isbiparte(i, adj, visited));
    }
    return true;
}

void solve() {
    int n, m;
    cin >> n >> m;

    vector<vector<int>> adj(n+1);

    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    int res = 0;
    vector<int> visited(n + 1, 0);

    for (int i = 1; i <= n; i++) {
        if (visited[i] != 0) continue;
        visited[i] = 1;
        if (!isbiparte(i, adj, visited)){
            cout << "0\n";
            return;
        } else res++;
    }
    cout << e(res) << "\n";
    return;
}

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