import java.util.HashSet;
import java.util.Set;
import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte(){
        if(ptr < buflen){
            return true;
        }else{
            ptr = 0;
            try{
                buflen = in.read(buffer);
            }catch(IOException e){
                e.printStackTrace();
            }
            if(buflen <=0){
                return false;
            }
        }
        return true;
    }

    private int readByte(){
        if(hasNextByte())return buffer[ptr++];
        else return -1;
    }

    private static boolean isPrintableChar(int c){
        return 33<=c && c<=126;
    }
    public boolean hasNext(){
        while(hasNextByte() && !isPrintableChar(buffer[ptr]))ptr++;
        return hasNextByte();
    }

    public String next(){
        if(!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong(){
        if(!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        if(b < '0' || '9' < b){
            throw new NumberFormatException();
        }
        while(true){
            if('0' <= b && b<='9'){
                n*=10;
                n+=b-'0';
            }else if(b==-1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt(){
        long nl = nextLong();
        if(nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDoutble(){return Double.parseDouble(next());}
}
class Main {

    int[] par ;
    int[] rank;
    int[] x,y,z;
    int n;
    int m;
    public static void main(String[] args) {
        Main clazz = new Main();
        clazz.solve();
    }

    void solve(){
        FastScanner fs = new FastScanner();
        n = fs.nextInt();
        m = fs.nextInt();
        par = new int[n];
        rank = new int[n];
        x = new int[m];
        y = new int[m];
        z = new int[m];

        for(int i=0;i<m;i++){
            x[i] = fs.nextInt()-1;
            y[i] = fs.nextInt()-1;
            z[i] = fs.nextInt()-1;
        }
        init();
        for(int i=0;i<m;i++){
            unite(x[i],y[i]);
        }
        Set<Integer> set = new HashSet<>();
        for(int i=0;i<n;i++){
            set.add(find(i));
        }
        System.out.println(set.size());
        System.out.flush();
        
    }

    void init(){
        for(int i=0;i<n;i++){
            par[i] = i;
        }
    }
    int find(int x){
        if(par[x]==x){
            return x;
        }else{
            return par[x] = find(par[x]);
        }
    }

    void unite(int x,int y){
        x = find(x);
        y = find(y);
        if(rank[x] < rank[y]){
            par[x] = y;
        }else{
            par[y] = x;
            if(rank[x] == rank[y]){
                rank[x]++;
            }
        }
    }

    boolean same(int x,int y){
        return find(x)==find(y);
    }

}

Measured memory_bytes: 32316