// UUID: 0c22c708-6928-4a17-bb79-31cb8d5444c9
#include <iostream>
#include <vector>

using namespace std;

const int MOD = 1000000007;
vector<int> adj[20005];
int color[20005];
bool hiba;

void dfs(int u, int c) {
    color[u] = c;
    for (int v : adj[u]) {
        if (color[v] == -1) {
            dfs(v, 1 - c);
        } else if (color[v] == c) {
            hiba = true;
        }
    }
}

void solve() {
    int N, K;
    if (!(cin >> N >> K)) return;
    for (int i = 0; i <= N; i++) {
        adj[i].clear();
        color[i] = -1;
    }
    hiba = false;

    for (int i = 0; i < K; i++) {
        int l, r;
        cin >> l >> r;
        adj[l - 1].push_back(r);
        adj[r].push_back(l - 1);
    }

    int komponensek = 0;
    for (int i = 0; i <= N; i++) {
        if (color[i] == -1) {
            komponensek++;
            dfs(i, 0);
        }
    }

    if (hiba) {
        cout << 0 << endl;
    } else {
        long long valasz = 1;
        for (int i = 0; i < komponensek - 1; i++) {
            valasz = (valasz * 2) % MOD;
        }
        cout << valasz << endl;
    }
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int T;
    if (!(cin >> T)) return 0;
    while (T--) solve();
    return 0;
}