#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
const int maxn = 1e6+10;
typedef long long ll;
vector<pair<int,int> > G[maxn];
int color[maxn];
int n, m;
bool not_exist = false;
bool vis[maxn];
ll pow_mod(ll a, ll b){
    ll ans = 1;
    while(b){
        if(b&1) ans = ans*a%mod;
        a = a*a%mod;
        b>>=1;
    }
    return ans;
}
bool dfs(int x, int c){
    vis[x] = true;
    color[x] = c;
    for(int i=0; i<G[x].size(); i++){
        int u = G[x][i].first;
        int r = G[x][i].second;
        int next_color = 3-c;
        if(r == 1) next_color = c;
        if(!vis[u]){
            dfs(u, next_color);
        }
        if(color[u]!=next_color){
            not_exist = true;
        }
    }
}
int main(){
    ios::sync_with_stdio(false);
    int u, v, r;
    for(int i=0; i<maxn; i++) G[i].clear();
    cin>>n>>m;
    for(int i=0; i<m; i++){
        cin>>u>>v>>r;
        G[u].push_back(make_pair(v, r));
        G[v].push_back(make_pair(u, r));
    }
    memset(vis, 0, sizeof(vis));
    int tot = 0;
    for(int i=1; i<=n; i++){
        if(!vis[i]){
            dfs(i, 1);
            tot++;
        }
    }
    //cout<<tot<<endl;
    if(not_exist){
        printf("0\n");
    }
    else{
        //cout<<tot<<endl;
        printf("%I64d\n", pow_mod(2, tot-1));
    }
    return 0;
}