#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const ll MOD = 998244353;

struct Node {
  int id;
  int cnt;

  Node(int id = -1, int cnt = -1) {
    this->id = id;
    this->cnt = cnt;
  }

  bool operator>(const Node &n) const {
    return cnt < n.cnt;
  }
};

struct Edge {
  int a;
  int b;
  int c;

  Edge(int a = -1, int b = -1, int c = -1) {
    this->a = a;
    this->b = b;
    this->c = c;
  }
};

vector<Edge> G[100010];

int main() {
  int N, Q;
  cin >> N >> Q;

  for (int i = 0; i < Q; ++i) {
    int a, b, c;
    cin >> a >> b >> c;

    G[a].push_back(Edge(a, b, c));
    G[b].push_back(Edge(b, a, c));
  }

  ll ans = 1;
  const int UNDEFINED = -1;
  vector<bool> visited(N + 1, false);
  vector<int> is_liar(N + 1, UNDEFINED);

  for (int i = 1; i <= N; ++i) {
    if (visited[i]) continue;

    queue<int> que;
    que.push(i);
    is_liar[i] = 0;
    bool ok = true;
    // fprintf(stderr, "i: %d\n", i);

    while (not que.empty() && ok) {
      int v = que.front();
      que.pop();

      if (visited[v]) continue;
      visited[v] = true;
      // fprintf(stderr, "  v: %d\n", v);

      for (Edge &e : G[v]) {
        if (is_liar[e.b] != UNDEFINED) {
          if (is_liar[e.a] == 0) {
            ok &= (is_liar[e.b] == e.c);
          } else {
            ok &= (is_liar[e.b] != e.c);
          }
        } else {
          if (is_liar[e.a] == 0) {
            is_liar[e.b] = e.c;
          } else {
            is_liar[e.b] = e.c ^ 1;
          }
        }

        que.push(e.b);
      }
    }

    if (ok) {
      ans *= 2;
    } else {
      ans *= 0;
    }
    ans %= MOD;
  }

  cout << ans << endl;


  return 0;
}