#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
int n, q;
const int N = 1e5 + 69;
pair <int, int> root[N];
bool good[N];
const int mod = 998244353;

pair <int, int> find(int x){
    if (root[x].f == x){
        return root[x];
    } else {
        auto p1 = find(root[x].f);
        p1.s ^= root[x].s;
        return p1;
    }
}

void unite(int x, int y, int d){
    pair <int, int> p1 = find(x);
    pair <int, int> p2 = find(y);
    d ^= p1.s;
    d ^= p2.s;
    
    if (p1.f != p2.f){
        root[p1.f] = {p2.f, d};
        good[p2.f] &= good[p1.f];
    } else {
        if (d != 0) good[p1.f] = false;
    }
}

void Solve() 
{
    cin >> n >> q;
    for (int i = 1; i <= n; i++){
        root[i] = {i, 1};
        good[i] = true;
    }
    
    for (int i = 1; i <= q; i++){
        int u, v, d; cin >> u >> v >> d;
        
        unite(u, v, d);
    }
    
    int ans = 1;
    for (int i = 1; i <= n; i++){
        if (i == find(i).f){
            if (good[i]) ans *= 2, ans %= mod;
            else ans = 0;
        }
    }
    
    cout << ans << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
  //  cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
   // cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}