import sys
sys.setrecursionlimit(1 << 25)

def main():
    MOD = 998244353
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr +=1
    Q = int(input[ptr])
    ptr +=1

    parent = list(range(N + 1))  # 1-based
    parity = [0] * (N + 1)
    component_count = N
    contradiction = False

    def find(u):
        path = []
        while parent[u] != u:
            path.append(u)
            u = parent[u]
        root = u
        for v in reversed(path):
            orig_parent = parent[v]
            parent[v] = root
            parity[v] ^= parity[orig_parent]
        return root

    for _ in range(Q):
        A = int(input[ptr])
        ptr +=1
        B = int(input[ptr])
        ptr +=1
        C = int(input[ptr])
        ptr +=1

        ra = find(A)
        rb = find(B)
        pa = parity[A]
        pb = parity[B]

        if ra != rb:
            component_count -= 1
            parent[ra] = rb
            parity[ra] = pa ^ pb ^ C
        else:
            if (pa ^ pb) != C:
                contradiction = True

    if contradiction:
        print(0)
    else:
        print(pow(2, component_count, MOD))

if __name__ == "__main__":
    main()