#include <bits/stdc++.h>
#include <atcoder/all>
using mint = atcoder::modint998244353;
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	atcoder::dsu uf(n);
	vector<vector<pair<int, int>>> g(n);
	for (int i = 0; i < m; i++){
		int a, b, c;
		cin >> a >> b >> c;
		a--;
		b--;
		g[a].push_back({b, c});
		uf.merge(a, b);
	}
	mint ans = 1;
	vector<int> f(n, -1);
	vector<bool> f2(n, true);
	for (auto s : uf.groups()){
		int c = 0;
		queue<int> q;
		q.push(s[0]);
		f[s[0]] = 0;
		while (!q.empty()){
			int v = q.front();
			q.pop();
			for (auto p : g[v]){
				if (f[p.first] == -1){
					f[p.first] = (f[v] ^ p.second);
					q.push(p.first);
				}
			}
		}
		q.push(s[0]);
		int ok = 2;
		while (!q.empty()){
			int v = q.front();
			q.pop();
			for (auto p : g[v]){
				if (f2[p.first]){
					if (f[p.first] != (f[v] ^ p.second)){
						ok = 0;
					}
					f2[p.first] = false;
					q.push(p.first);
				}
			}
		}
		ans *= ok;
	}
	cout << ans.val() << endl;
}