def main():
  from sys import stdin, setrecursionlimit
  input = stdin.readline
  readline = stdin.readline
  N,Q=map(int, input().split())
  D=[[] for i in range(N)]
  for i in range(Q):
    a,b,c=map(int, input().split())
    a-=1
    b-=1
    D[a].append((b,c))
    D[b].append((a,c))
    
  ans=1;mod=998244353 
  V=[-1]*N
  from collections import deque
  for i in range(N):
    if V[i]==-1:
      v=0
      d=deque()
      d.append(i)
      V[i]=0
      while d:
        now=d.popleft()
        for nex,c in D[now]:
          if V[nex]==-1:
            if V[now]==c:
              V[nex]=0
            else:
              V[nex]=1
            d.append(nex)
          else:
            if V[now]==c:
              f=0
            else:
              f=1 
            if V[nex]!=f:
              v=1 
      ans*=(2-2*v)
      ans%=mod
  print(ans)
main()