#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint998244353;

int main(){
  int n,q;
  cin >> n >> q;
  vector<vector<pair<bool,int>>> to(n);
  vector<int> seen(n, -1);
  for(int i=0;i<q;i++){
    int t, a, b;
    cin >> t >> a >> b;
    a--;
    b--;
    to.at(a).push_back({t, b});
    to.at(b).push_back({t, a});
  }
  queue<int> qu;
  mint ans = 1;
  for(int i=0;i<n;i++){
    if(seen.at(i) < 0){
      seen.at(i) = 0;
      qu.push(i);
      ans *= 2;
      while(!qu.empty()){
        int p = qu.front();
        qu.pop();
        for(auto j: to.at(p)){
          if(seen.at(j.second) < 0){
            seen.at(j.second) = seen.at(p) ^ j.first;
            qu.push(j.second);
          }else if(seen.at(j.second) != seen.at(p) ^ j.first){
            ans = 0;
          }
        }
      }
    }
  }
  cout << ans.val() << endl;
}