N,Q=map(int, input().split())
D=[[] for i in range(N)]
par=[i for i in range(N)]
rank=[0]*N;friend=[0]*N
block=[0]*N;size=[1]*N
def find(x):
  if par[x]==x:
    return x
  else:
    par[x]=find(par[x])
    return par[x]
 
#同じ集合か判定
def same(x,y):
  return find(x)==find(y)
 
def union(x,y):
  x=find(x)
  y=find(y)
  if x==y:
    return 
  if rank[x]>rank[y]:
    par[y]=x
    size[x]+=size[y]
  else:
    par[x]=y
    size[y]+=size[x]
    if rank[x]==rank[y]:
      rank[y]+=1
 
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))
  union(a,b)
  
ans=1;mod=998244353;DD={}
from collections import deque
for i in range(N):
  d=find(i)
  if d in DD:
    continue 
  DD[d]=1;v,w=0,0;V=[-1]*N
  d=deque()
  d.append(i);V[i]=0
  while d:
    now=d.popleft()
    if v==1:
      break
    for nex,c in D[now]:
      if V[nex]==-1:
        if V[now]==c:
          V[nex]=0;d.append(nex)
        else:
          V[nex]=1;d.append(nex)
      else:
        if V[now]==c:
          f=0
        else:
          f=1 
        if V[nex]!=f:
          v=1 
          break
  d=deque()
  V=[-1]*N
  d.append(i);V[i]=1
  while d:
    now=d.popleft()
    if w==1:
      break
    for nex,c in D[now]:
      if V[nex]==-1:
        if V[now]==c:
          V[nex]=0;d.append(nex)
        else:
          V[nex]=1;d.append(nex)
      else:
        if V[now]==c:
          f=0
        else:
          f=1 
        if V[nex]!=f:
          w=1
          break
  ans*=(2-v-w)
  ans%=mod
  if ans==0:
    print(0)
    exit()
print(ans)