import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

def dfs(u):
    st=[u]
    while st:
        u=st.pop()
        for v,c in to[u]:
            if color[v]==-1:
                color[v]=color[u]^c
                st.append(v)
            elif color[v]!=color[u]^c:
                return False
    return True

n,q=LI()
to=[[] for _ in range(n)]
for _ in range(q):
    u,v,c=LI1()
    c+=1
    to[u].append((v,c))
    to[v].append((u,c))

color=[-1]*n
cnt=0
for u in range(n):
    if color[u]!=-1:continue
    color[u]=0
    cnt+=1
    if not dfs(u):
        print(0)
        exit()
print(pow(2,cnt,md))