n,q = map(int,input().split())
e = [[] for i in range(n)]
mod = 998244353
ans = 1
for i in range(q):
    a,b,c = map(int,input().split())
    a,b = a-1,b-1
    e[a].append([b,c])
    e[b].append([a,c])


vis = [0]*n
id = 0
def search(u,c,id):
    dic = {}

    dic[u] = c
    vis[u] = id

    q = [u]
    ok = 1
    while q:
        now = q.pop()
        c = dic[now]
        for nex,nc in e[now]:
            
            judge = nc^c

            if nex in dic and dic[nex] != judge:
                ok = 0
            
            if vis[nex] == id:
                continue
            dic[nex] = judge
            vis[nex] = id
            q.append(nex)
    return ok


for u in range(n):
    if vis[u]:
        continue

    num = search(u,0,id+1) + search(u,1,id+2)
    ans *= num
    ans %= mod
    id += 2
print(ans)