#include <bits/stdc++.h>

using namespace std;
struct UnionFind {
    vector<int> par;
    
    UnionFind(int n) : par(n, -1) { }
    void init(int n) { par.assign(n, -1); }
    
    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y); // merge technique
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
};
const int mod = 998244353;
// const int mod = 1000000007;
struct modint {
    long long a = 0;
    modint(long long x = 0) {while (x < 0) x += mod; a = x % mod;}
    modint(const modint &r) {a = r.a;}
    modint operator -(){return modint(-a);}
    modint operator +(const modint &r) {return modint(*this) += r;}
    modint operator -(const modint &r) {return modint(*this) -= r;}
    modint operator *(const modint &r) {return modint(*this) *= r;}
    modint &operator +=(const modint &r) {
      a += r.a;
      if(a >= mod) a -= mod;
      return *this;
    }
    modint &operator -=(const modint &r) {
        a -= r.a;
        if(a < 0) a += mod;
        return *this;
    }
    modint &operator *=(const modint &r) {
        a = a * r.a % mod;
        return *this;
    }
    modint pow(long long r) const {
        if (!r) return 1;
        modint x = pow(r >> 1);
        x *= x;
        if (r & 1) x *= *this;
        return x;
    }
    modint inverse() const {
        return pow(mod - 2);
    }
    modint& operator/=(const modint r) {
        return (*this) *= r.inverse();
    }
    modint operator/(const modint r) const {
        modint res(*this);
        return res /= r;
    }
};
 
istream &operator>>(istream &is, modint &x) {
    long long t;
    is >> t;
    x = t;
    return is;
}
ostream &operator<<(ostream &os, const modint& x) {
    return os << x.a;
}
const int MAX = 500044;
modint fac[MAX], inv[MAX], finv[MAX];
void cominit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAX; i++) {
        fac[i] = fac[i - 1] * modint(i);
        inv[i] = - inv[mod % i] * modint(mod / i);
        finv[i] = finv[i - 1] * inv[i];
    }
}
modint Com(long long n, long long k) {
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] * finv[n - k];
}
modint Per(long long n, long long k) {
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[n - k];
}
 
using Mint = modint;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q;
    cin >> n >> q;
    UnionFind uf(2 * n);
    for (int i = 0; i < q; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        a--, b--;
        if (c == 0) {
            uf.merge(a, b);
            uf.merge(a + n, b + n);
        } else {
            uf.merge(a + n, b);
            uf.merge(a, b + n);
        }
    }
    for (int i = 0; i < n; i++) {
        if (uf.issame(i, i + n)) {
            cout << 0 << '\n';
            return 0;
        }
    }
    set<int> st;
    for (int i = 0; i < 2 * n; i++) {
        st.insert(uf.root(i));
    }
    int cnt = st.size() / 2;
    cout << Mint(2).pow(cnt) << '\n';
}