/* -*- coding: utf-8 -*-
 *
 * 2277.cc:  No.2277 Honest or Dishonest ? - yukicoder
 */

#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<utility>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_QN = 100000;
const int MOD = 998244353;

/* typedef */

typedef long long ll;
typedef queue<int> qi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

/* global variables */

vpii nbrs[MAX_N];
int ds[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, qn;
  scanf("%d%d", &n, &qn);

  for (int i = 0; i < qn; i++) {
    int ai, bi, ci;
    scanf("%d%d%d", &ai, &bi, &ci);
    ai--, bi--;
    nbrs[ai].push_back({bi, ci});
    nbrs[bi].push_back({ai, ci});
  }

  int ans = 1;
  fill(ds, ds + n, -1);

  for (int st = 0; st < n; st++)
    if (ds[st] < 0) {
      ans = (ll)ans * 2 % MOD;
      ds[st] = 0;
      qi q;
      q.push(st);

      while (! q.empty()) {
	int u = q.front(); q.pop();
	for (auto [v, c]: nbrs[u]) {
	  if (ds[v] < 0) {
	    ds[v] = ds[u] ^ c;
	    q.push(v);
	  }
	  else if (ds[v] != (ds[u] ^ c)) {
	    puts("0"); return 0;
	  }
	}
      }
    }

  printf("%d\n", ans);
  return 0;
}