#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
long long max3(long long x, long long y, long long z) {
  return max(max(x, y), z);
}
long long min3(long long x, long long y, long long z) {
  return min(min(x, y), z);
}
const long long M = 2e5 + 10, M2 = 1e6 + 10, mod = 1e9 + 7, inf = 1e17 + 10;
void add(int& a, int b) {
  a += b;
  if (a >= mod) {
    a -= mod;
  }
}
int X[] = {0, 1, 0, -1};
int Y[] = {-1, 0, 1, 0};
long long power(long long x, long long n) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % mod;
    x = ((x % mod) * (x % mod)) % mod;
    n = n / 2;
  }
  return result;
}
long long n, m;
long long a[101], b[101], c[101];
long long dp[101][101];
long long vis[101];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (long long i = 1; i < n + 1; i++) {
    for (long long j = 1; j < n + 1; j++) {
      if (i != j) {
        dp[i][j] = inf;
        dp[j][i] = inf;
      } else {
        dp[i][j] = 0;
      }
    }
  }
  for (long long i = 0; i < m; i++) {
    cin >> a[i] >> b[i] >> c[i];
    if (a[i] != b[i]) {
      dp[a[i]][b[i]] = c[i];
      dp[b[i]][a[i]] = c[i];
    }
  }
  for (long long k = 1; k <= n; k++) {
    for (long long i = 1; i <= n; i++) {
      for (long long j = 1; j <= n; j++) {
        if (dp[i][j] > dp[i][k] + dp[k][j]) {
          dp[i][j] = dp[i][k] + dp[k][j];
        }
      }
    }
  }
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    if (dp[a[i]][b[i]] < c[i]) ans++;
  }
  cout << ans;
  return 0;
}
