#include <bits/stdc++.h>
using namespace std;

#ifdef _RUTHEN
#include <debug.hpp>
#else
#define show(...) true
#endif

#define REP(i, n) for (int i = 0; i < (n); i++)
template <class T> using V = vector<T>;

#include <atcoder/modint>
using mint = atcoder::modint998244353;
#include <atcoder/dsu>

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, Q;
    cin >> N >> Q;
    atcoder::dsu uf(N + N);
    vector<int> A(Q), B(Q), C(Q);
    REP(i, Q) {
        cin >> A[i] >> B[i] >> C[i];
        A[i]--, B[i]--;
        if (C[i] == 0) {
            uf.merge(A[i], B[i]);
            uf.merge(A[i] + N, B[i] + N);
        } else {
            uf.merge(A[i] + N, B[i]);
            uf.merge(A[i], B[i] + N);
        }
    }
    int ok = 1;
    REP(i, N) if (uf.same(i, i + N)) ok = 0;
    mint ans = 1;
    REP(i, N) if (uf.leader(i) == i) ans *= 2;
    if (ok == 0) ans = 0;
    cout << ans.val() << '\n';
    return 0;
}