class UnionFind:
	def __init__(self, n):
		self.n = n
		self.parents = [-1] * n
	
	def find(self, x):
		if self.parents[x] < 0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]
	
	def union(self, x, y):
		x = self.find(x)
		y = self.find(y)
		if x == y:
			return
		if self.parents[x] > self.parents[y]:
			x, y = y, x
		self.parents[x] += self.parents[y]
		self.parents[y] = x


mod = 998244353
n, q = map(int,input().split())
ikeru = [[] for i in range(2*n)]
uf = UnionFind(2*n)
for i in range(q):
	a, b, c = map(int,input().split())
	a-=1; b-=1
	if c == 0:
		uf.union(a, b)
		uf.union(n+a, n+b)
	else:
		uf.union(a, n+b)
		uf.union(n+a, b)

ans = 1
for i in range(n):
	if uf.find(i) == uf.find(i+n):
		ans = 0
	if uf.find(i) == i:
		ans *= 2
		ans %= mod

print(ans)