#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<int> f2(n, -1);
	vector<bool> f_(n);
	vector<bool> f2_(n);
	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);
				}
			}
		}
		bool ok = true;
		q.push(s[0]);
		while (!q.empty()){
			int v = q.front();
			q.pop();
			for (auto p : g[v]){
				if (f_[p.first]){
					continue;
				}
				if (f[p.first] != (f[v] ^ p.second)){
					ok = false;
				}
				f_[p.first] = true;
				q.push(p.first);
			}
		}
		c += ok;
		q.push(s[0]);
		f2[s[0]] = 1;
		while (!q.empty()){
			int v = q.front();
			q.pop();
			for (auto p : g[v]){
				if (f2[p.first] == -1){
					f2[p.first] = f2[v] ^ p.second;
					q.push(p.first);
				}
			}
		}
		ok = true;
		q.push(s[0]);
		while (!q.empty()){
			int v = q.front();
			q.pop();
			for (auto p : g[v]){
				if (f2_[p.first]){
					continue;
				}
				if (f2[p.first] != (f2[v] ^ p.second)){
					ok = false;
				}
				f2_[p.first] = true;
				q.push(p.first);
			}
		}
		c += ok;
		ans *= c;
	}
	cout << ans.val() << endl;
}