import sys
input = sys.stdin.readline


class UnionFind:
    def __init__(self, N):
        self.par = [-1] * N

    def find(self, x):
        r = x
        while self.par[r] >= 0:
            r = self.par[r]
        while x != r:
            tmp = self.par[x]
            self.par[x] = r
            x = tmp
        return r

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.par[x] > self.par[y]:
            x, y = y, x
        self.par[x] += self.par[y]
        self.par[y] = x

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def size(self, x):
        return -self.par[self.find(x)]


N, Q = map(int, input().split())
mod = 998244353
uf = UnionFind(2*N)
for i in range(Q):
    A, B, C = map(int, input().split())
    A -= 1
    B -= 1
    if C == 0:
        uf.unite(A, B)
        uf.unite(N+A, N+B)
    else:
        uf.unite(A, N+B)
        uf.unite(N+A, B)
for i in range(N):
    if uf.same(i, N+i):
        print(0)
        exit()

cnt = 0
for i in range(2*N):
    if uf.find(i) == i:
        cnt += 1
print(pow(2, cnt//2, mod))