#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 200000 + 20;
int parent[maxn];
int sum[maxn];
int dis;
int GetParent(int a) {
if( a != parent[a] ) {
int t = parent[a];
parent[a] = GetParent( parent[a] );
sum[a] += sum[t];
}
return parent[a];
}
void Merge( int a, int b ) {
int pa = GetParent( a );
int pb = GetParent( b );
if( pa != pb ) {
parent[pb] = pa;
sum[pb] = sum[a] - sum[b] + dis;
}
return ;
}
int main() {
int N, M;
while( cin >> N >> M ) {
for(int i=0; i<=N; ++i) {
parent[i] = i;
sum[i] = 0;
}
int ans = 0;
while( M-- ) {
int a, b;
cin >> a >> b >> dis;
-- a;
int pa = GetParent(a);
int pb = GetParent(b);
Merge(a, b);
GetParent( b );
if( pa==pb && sum[b]-sum[a]!=dis ) {
++ ans;
}
}
cout << ans << endl;
}
return 0;
}