#include<iostream>
#include<vector>
#include<algorithm>
#include<tuple>
#include<queue>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

struct UnionFind {
    vector<int> par, siz;
    UnionFind(int n) : par(n,-1), siz(n,1) {}
    int find(int x){
        if (par[x] == -1) return x;
        else{
            par[x] = find(par[x]);
            return par[x];
        }
    }
    bool same(int x, int y){
        return find(x) == find(y);
    }
    int size(int x){
        return siz[find(x)];
    }
    void merge(int x, int y){
        x = find(x);
        y = find(y);
        if (x == y) return;
        if (siz[x] < siz[y]) swap(x,y);
        siz[x] += siz[y];
        par[y] = x;
    }
};

const ll MOD=998244353;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,q;
    cin>>n>>q;
    vector<vector<pair<int,int>>>g(n);
    UnionFind uf(n);
    vector<tuple<int,int,int>>V;
    rep(i,q){
        int a,b,c;
        cin>>a>>b>>c;
        a--;
        b--;
        V.push_back(make_tuple(a,b,c));
        if(!uf.same(a,b)){
            uf.merge(a,b);
            g[a].push_back(make_pair(b,c));
            g[b].push_back(make_pair(a,c));
        }
    }
    ll ans=1;
    vector<bool>flag(n);
    vector<int>C(n,-1);
    rep(i,n){
        int l=uf.find(i);
        if(flag[l])continue;
        C[i]=1;
        queue<int>q;
        q.push(i);
        while(q.size()){
            int x=q.front();
            q.pop();
            for(auto[j,c]:g[x]){
                if(C[j]!=-1)continue;
                if(c==0)C[j]=C[x];
                else C[j]=1-C[x];
                q.push(j);
            }
        }
        flag[l]=true;
        ans=2*ans%MOD;
    }
    for(auto[a,b,c]:V){
        if(c==0&&C[a]!=C[b])ans=0;
        if(c==1&&C[a]==C[b])ans=0;
    }
    cout<<ans<<"\n";
}