#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

class UnionFind{
    public:
        vector<int> rank,parent;
        //コンストラクタ
        UnionFind(int n){
            rank.resize(n,0);
            parent.resize(n,0);
            for(int i=0;i<n;i++){
                parent[i]=i;
                rank[i]=0;
            }
        }

        //根を求める(代表元を求める)
        int find_root(int x){
            if(parent[x]==x)
                return x;
            else
                return parent[x] = find_root(parent[x]);
        }

        //xとyの属する集合を併合
        void unite(int x,int y){
            //x,yをそれぞれの属する集合の代表元にする
            x = find_root(x);
            y = find_root(y);
            //代表元が同じならすでに同じ集合
            if(x==y) return;

            if(rank[x]<rank[y]){
                //xよりyの木の高さが高い時はxの親をyにする
                parent[x]=y;
            }else{
                //xよりyの木の高さが低い時はyの親をxにする
                parent[y]=x;
                //xとyの木の高さが等しい時はxの高さが1増える
                if(rank[x]==rank[y]) rank[x]++;
            }
        }

        //xとyが同じ集合に属するか?
        bool same(int x,int y){
            return find_root(x)==find_root(y);
        }
};

int N,M;
vector<int> X,Y,Z;

int main(){
    cin >> N >> M;
    X.resize(M);
    Y.resize(M);
    Z.resize(M);
    UnionFind uf(N);
    rep(i,M){
        cin >> X[i] >> Y[i] >> Z[i];
        Z[i] %= 2;
        X[i]--;
        Y[i]--;

        uf.unite(X[i],Y[i]);
    }

    set<int> st;
    for(int i=0;i<N;i++){
        st.insert(uf.find_root(i));
    }
    cout << st.size() << endl;
}


Measured memory_bytes: 6912