#include <bits/stdc++.h>
#include <atcoder/all>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
using namespace std;
using namespace atcoder;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vll=vector<ll>;
using vvll=vector<vll>;
using pll=pair<ll,ll>;

// using mint=modint;

// template<class K,class V>
// using ordered_map=tree<K,V,less<K>,rb_tree_tag,tree_order_statistics_node_update>;


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

    ll N,Q;
    cin>>N>>Q;
    vector<vector<pll>>g(N);
    rep(i,0,Q){
        ll A,B,C;
        cin>>A>>B>>C;
        --A,--B;
        g[A].push_back({B,C});
        g[B].push_back({A,C});
    }

    vll col(N,-1);
    ll comp=0;

    rep(s,0,N){
        if(col[s]!=-1)continue;
        comp++;
        col[s]=0;
        queue<ll>q;
        q.push(s);
        while(!q.empty()){
            ll u=q.front();
            q.pop();
            for(auto [v,c]:g[u]){
                ll nc=col[u]^c;
                if(col[v]==-1){
                    col[v]=nc;
                    q.push(v);
                }else if(col[v]!=nc){
                    cout<<0<<endl;
                    return 0;
                }
            }
        }
    }
    modint998244353 ans=1;
    rep(i,0,comp)ans*=2;
    cout<<ans.val()<<endl;

}