#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#define MAX 100000
using namespace std;
struct edge{
int a,b;
int w;
};
edge se[MAX];//储存边
int set[MAX];//辅助集合
int n, m, sum = 0;
bool cmp(edge e1, edge e2){
return e1.w > e2.w;
}
int find(int x){
return x == set[x]? x : set[x] = find(set[x]);
}
int main(){
scanf("%d %d", &n, &m);
for(int i = 0; i < m; i++){
int a, b, w;
scanf("%d %d %d", &se[i].a, &se[i].b, &se[i].w);
}
for(int i = 1; i <= n; i++){
set[i] = i;
}
sort(se,se+m,cmp);
int day = se[0].w;
for(int i = 0; i < m; day--){
int flag = 0;
while(day == se[i].w){
int a = find(set[se[i].a]);
int b = find(set[se[i].b]);
if(a != b){
flag = 1;
set[a] = b;
}
i++;
}
sum += flag;
}
cout<< sum << endl;
return 0;
}