ll cycleCount;

void dfs(vector<ll> adj[],ll curr,ll par,vector<bool>& visited){
    visited[curr] = true;
    for(auto u:adj[curr]){
        if(!visited[u]){
            dfs(adj,u,curr,visited);
        }
        else if(u!=par){
            cycleCount++;
        }
    }
}

void solve(ll tc){
    ll n,m;
    cin>>n>>m;

    vector<ll> adj[n+1];

    for(ll i=0;i<m;i++){
        ll x,y;
        cin>>x>>y;
        adj[x].pb(y);
        adj[y].pb(x);
    }

    vector<bool> visited(n+1,false);

    ll k  = 0;

    for(ll i=1;i<=n;i++){
        if(!visited[i]){

            cycleCount = 0;

            dfs(adj,i,-1,visited);

            cycleCount = cycleCount/2;

            debug(cycleCount);

            if(cycleCount!=1){
                continue;
            }

            k++;
        }
    }   

    if(k==0){
        cout<<0<<endl;
        return;
    }   

    ll ans = modExpo(2,k);
    ans  =  ans%mod;

    cout<<ans<<endl;
}