#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Edge {
	int to, type;
	Edge(int _to, int _type) :to(_to), type(_type) {}
};
vector<Edge>g[200005];
int col[100005];
bool dfs(int v, int p = -1) {
	if (-1 == p)col[v] = 0;
	bool ret = true;
	for (Edge e : g[v]) {
		int nx = col[v];
		if (e.type)nx ^= 1;
		if (-1 != col[e.to]) {
			if (nx != col[e.to])ret = false;
		}
		else {
			col[e.to] = nx;
			ret &= dfs(e.to, v);
		}
	}
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	while (q--) {
		int a, b, c; cin >> a >> b >> c;
		a--, b--;
		g[a].push_back({ b,c });
		g[b].push_back({ a,c });
	}
	rep(i, n)col[i] = -1;
	mint ans = 1;
	rep(i, n) {
		if (-1 != col[i])continue;
		auto get = dfs(i);
		if (get)ans *= 2;
		else ans *= 0;
	}
	cout << ans.val() << endl;
	return 0;
}