#include <bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr LL mod = 998244353;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<vector<pair<int, int>>> g(n + 1);
    for (int i = 0, a, b, c; i < m; i += 1) {
        cin >> a >> b >> c;
        g[a].emplace_back(b, c);
        g[b].emplace_back(a, c);
    }
    vector<int> vis(n + 1, -1);
    LL ans = 1;
    function<void(int)> dfs = [&](int u) {
        for (auto [v, w] : g[u]) {
            if (vis[v] == -1) {
                vis[v] = vis[u] ^ w;
                dfs(v);
            } else if (vis[v] != (vis[u] ^ w)) {
                ans = 0;
            }
        }
    };
    for (int i = 1; i <= n; i += 1) {
        if (vis[i] == -1) {
            vis[i] = 0;
            dfs(i);
            ans = ans * 2 % mod;
        }
    }
    cout << ans;
}