#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <bitset>
#include <tuple>
#include <cmath>
#include <complex>
#include <algorithm>
#include <utility>
#include <regex>
#include <cstdint>
#include <numeric>
#include <functional>
#include <cassert>

using namespace std;
using ll = int64_t;
using ull = uint64_t;

constexpr ll INF = 1000000000;/* 1e+9a */
namespace utils{

    class Repeater{
        int st;
        int ed;
        int d;
    public:
        class rep_iterator{
            int i; int d;
        public:
            rep_iterator(int x, int pd) :i(x), d(pd) {}

            int& operator*(){ return i; }
            bool operator==(const rep_iterator& k) const { return i == k.i; }
            bool operator!=(const rep_iterator& k) const { return i != k.i; }
            rep_iterator& operator++(){ i+=d; return *this; }
        };

        explicit Repeater(int N) :st(0), ed(N), d(1) {}
        Repeater(int b, int e) :st(b), ed(e), d(1) {if(st > ed){ st--; ed--; d = -1; } }

        rep_iterator begin() const{ return rep_iterator(st, d); }
        rep_iterator end() const{ return rep_iterator(ed, d); }

    };

    template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>;
    template<class T> using min_queue = p_queue<T, greater<T>>;
    template<class T> using max_queue = p_queue<T, less<T>>;

    template<class T> bool min_update(T& X, const T& A){ if(X > A) {X = A; return true;} return false; }
    template<class T> bool max_update(T& X, const T& A){ if(X < A) {X = A; return true;} return false; }
#define ALL(x) begin(x), end(x)
#define rALL(x) rbegin(x), rend(x)
}
using namespace utils;

namespace Xelmh_UFF {
    class UFF {
        using Int = int;
        std::vector<Int> parent;
        std::vector<Int> rank;

    public:
        explicit UFF(Int n) : parent(n, -1), rank(n, 0) {}

        Int find(Int x) {
            auto &px = parent[x];
            if (px < 0) {
                return x;
            } else {
                return px = find(px);
            }
        }

        bool unite(Int a, Int b) {
            const auto pa = find(a);
            const auto pb = find(b);
            if (pa == pb) return false;

            if (rank[pa] > rank[pb]) {
                parent[pa] += parent[pb];
                parent[pb] = pa;
            } else {
                parent[pb] += parent[pa];
                parent[pa] = pb;

                if (rank[pa] == rank[pb]) {
                    rank[pb]++;
                }
            }
            return true;
        };

        Int size(Int x) {
            const auto px = find(x);
            return -parent[px];
        }

        bool is_same(Int a, Int b) {
            const auto pa = find(a);
            const auto pb = find(b);
            return pa == pb;
        }

    };
}
using namespace Xelmh_UFF;



void sub_main(istream &is) {
    ll N , M;
    is >> N >> M;
    if(!is) return;
    UFF uf(N);
    for (auto &&i : Repeater(0, M)) {
        int x, y, z;
        is >> x >> y >> z;
        x--; y--;
        uf.unite(x, y);
    } // end i

    unordered_set<int> sets;
    for (auto &&x : Repeater(0, N)) {
        sets.insert(uf.find(x));
    } // end x
    cout << sets.size() << endl;


}

int main(int argc, char *argv[]) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(16) << scientific;
#ifdef DEBUG
    string test_cases = "test_E.txt";
    cerr << "DEBUG MODE" <<  endl;
    cerr << test_cases << " -->" << endl;
    auto fs = fstream(test_cases, fstream::in);
    int lp = 0;
    while(fs) {
        lp++;
        cout << lp <<  "#------\n";
        sub_main(fs);
    }
    cout << "------#" << endl;
    if(lp <= 1) sub_main(cin);
#else
    sub_main(cin);
#endif
    return 0;
}


Measured memory_bytes: 5156