const MOD = 998244353n;
const d = require('fs').readFileSync(0, 'utf8').split(/\s+/);
let p = 0;
const n = +d[p++], q = +d[p++];
const par = new Int32Array(n + 1), rnk = new Int32Array(n + 1), w = new Int8Array(n + 1);
for (let i = 0; i <= n; i++) par[i] = i;
const stack = new Int32Array(n + 1);
function find(x) {
  let top = 0;
  while (par[x] !== x) { stack[top++] = x; x = par[x]; }
  const root = x;
  for (let i = top - 1; i >= 0; i--) { const v = stack[i]; w[v] ^= w[par[v]]; par[v] = root; }
  return root;
}
let ok = true;
for (let i = 0; i < q; i++) {
  const t = +d[p++], a = +d[p++], b = +d[p++];
  const ra = find(a), rb = find(b);
  if (ra === rb) {
    if (((w[a] ^ w[b]) & 1) !== t) ok = false;
  } else {
    let x = ra, y = rb, wx = w[a], wy = w[b];
    if (rnk[ra] < rnk[rb]) { x = rb; y = ra; wx = w[b]; wy = w[a]; }
    par[y] = x;
    w[y] = (wx ^ wy ^ t) & 1;
    if (rnk[x] === rnk[y]) rnk[x]++;
  }
}
if (!ok) { console.log(0); } else {
  let comp = 0;
  for (let i = 1; i <= n; i++) if (find(i) === i) comp++;
  let ans = 1n, base = 2n, e = BigInt(comp);
  while (e > 0n) { if (e & 1n) ans = ans * base % MOD; base = base * base % MOD; e >>= 1n; }
  console.log(ans.toString());
}