def find(x):
    if P[x] == x: return x
    else:
        P[x] = find(P[x]) #経路圧縮
        return P[x]
        # return find(P[x]) #経路圧縮なし

def same(x,y):
    return find(x) == find(y)

def unite(x,y):
    x = find(x)
    y = find(y)
    if x == y: return 0
    if x > y: x,y = y,x
    P[y] = x

def group_count():
    for i in range(N):
        P[i] = find(i)
    return len(set(P))

MOD = 998244353
N,Q = map(int,input().split())
ABC = [list(map(int,input().split())) for _ in range(Q)]

P = [i for i in range(N)]
state = [-1] * N
for a,b,c in ABC:
    a -= 1
    b -= 1
    unite(a,b)
    if state[a] == -1 and state[b] == -1:
        state[a] = 0
        state[b] = 0 ^ c
    elif state[a] == -1:
        state[a] = state[b] ^ c
    elif state[b] == -1:
        state[b] = state[a] ^ c
    else:
        if state[a] != state[b] ^ c:
            print(0)
            exit()

x = group_count()
print(pow(2,x,MOD))