import sys
sys.setrecursionlimit(1 << 25)

def main():
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr +=1
    M = int(input[ptr])
    ptr +=1
    
    parent = list(range(N+1))  # Nodes are 1-based
    
    def find(u):
        while parent[u] != u:
            parent[u] = parent[parent[u]]
            u = parent[u]
        return u
    
    def union(u, v):
        u_root = find(u)
        v_root = find(v)
        if u_root == v_root:
            return
        if u_root < v_root:
            parent[v_root] = u_root
        else:
            parent[u_root] = v_root
    
    for _ in range(M):
        a = int(input[ptr])
        ptr +=1
        b = int(input[ptr])
        ptr +=1
        c = int(input[ptr])
        ptr +=1
        union(a, b)
    
    # Count the number of distinct roots
    components = set()
    for i in range(1, N+1):
        components.add(find(i))
    print(len(components))

if __name__ == "__main__":
    main()