#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vvvl=vector<vector<vector<long long>>>;
using pl=pair<long long,long long>;
using vpl=vector<pair<long long,long long>>;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#include <atcoder/all>
using namespace atcoder;

long long modpow(long long a, long long n, long long mo){long long res=1;while(n>0){if(n&1){res=res*a%mo;}a=a*a%mo;n>>=1;}return res;}
long long Pow(long long a, long long n){long long res=1;while(n>0){if(n&1){res=res*a;}a=a*a;n>>=1;}return res;}

const ll MOD=998244353;
const ll INF=(1ll<<60);

int main(){
  ll N;
  cin>>N;
  ll Q;
  cin>>Q;
  dsu d(N);
  vvl G(N+Q,vl(0));
  rep(i,Q){
    ll a,b,c;
    cin>>a>>b>>c;
    d.merge(a-1,b-1);
    if(c==1){
      G[a-1].pb(b-1);
      G[b-1].pb(a-1);
    }
    else{
      G[a-1].pb(N+i);
      G[N+i].pb(a-1);
      G[b-1].pb(N+i);
      G[N+i].pb(b-1);
    }
  }
  vl color(N+Q,-1);
  bool can=true;
  rep(i,N+Q){
    if(color[i]!=-1) continue;
    color[i]=0;
    queue<ll> q;
    q.push(i);
    while(!q.empty()){
      ll v=q.front();
      q.pop();
      for(ll u:G[v]){
        if(color[u]==color[v]) can=false;
        if(color[u]!=-1) continue;
        color[u]=(color[v]+1)%2;
        q.push(u);
      }
    }
  }
  if(!can) {cout<<0<<endl;return 0;}
  cout<<modpow(2,d.groups().size(),MOD)<<endl;
}