import sys
input = sys.stdin.readline
mod = 998244353
from collections import deque

N, Q = map(int, input().split())
adj = [[] for _ in range(N + 1)]
for _ in range(Q):
    a, b, c = map(int, input().split())
    adj[a].append((b, c))
    adj[b].append((a, c))

ans = 1
seen = [-1] * (N + 1)
for v0 in range(1, N + 1):
    if seen[v0] != -1:
        continue
    seen[v0] = 0
    que = deque()
    que.append(v0)
    ok = 1
    V = []
    while que:
        v = que.popleft()
        V.append(v)
        for u, c in adj[v]:
            if seen[u] == -1:
                if c == 0:
                    seen[u] = seen[v]
                else:
                    seen[u] = seen[v] ^ 1
                que.append(u)
            else:
                if c == 0:
                    if seen[u] != seen[v]:
                        ok = 0
                else:
                    if seen[u] == seen[v]:
                        ok = 0
    if ok:
        ans = (ans * 2) % mod
    else:
        ans = 0
print(ans)