#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b) ; ++i)
#define all(x) begin(x) , end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int , int> pii;
typedef vector<int> vi;
const int MAXN = 2e5+5;
int deg[2][MAXN],ded[MAXN];
vector<pii>adj[MAXN];
int par[2][MAXN],szz[2][MAXN];
int find(int x,int c){
    if(par[c][x] == x)return x;
    return par[c][x] = find(par[c][x],c);
}
void unite(int a,int b,int c){
    a = find(a,c);
    b = find(b,c);
    if(a==b)return;
    par[c][a] = b;
    szz[c][b] += szz[c][a];
}
map<pii,int>mp[2];
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int n,m;
    cin>>n>>m;
    ll ans = n;
    for(int i=1;i<=n;i++){
        par[0][i] = par[1][i] = i;
        szz[0][i] = szz[1][i] = 1;
    }
    for(int i=0;i<m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        if(a>b)swap(a,b);
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
        deg[c][a]++;
        deg[c][b]++;
        unite(a,b,c);
        mp[c][{a,b}]++;
    }
    for(auto [x,y]:mp[0]){
        if(mp[1][x])ans++;
    }

    map<pii,int>comp;
    for(int i=1;i<=n;i++){comp[{find(i,0),find(i,1)}]++;}
    for(auto [x,y]:comp){
        if(szz[0][x.first] == y && szz[1][x.second] == y && szz[0][x.first] >2)ans++;
    }


    cout<<ans<<'\n';
}