#include <bits/stdc++.h>
using namespace std;
const int INF = 100009;
int main() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>> dist(n, vector<int>(n));
  vector<int> a(n), b(n), c(n);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i == j)
        dist[i][j] = 0;
      else
        dist[i][j] = INF;
    }
  }
  for (int i = 0; i < m; i++) {
    cin >> a[i] >> b[i] >> c[i];
    a[i]--, b[i]--;
    dist[a[i]][b[i]] = dist[b[i]][a[i]] = c[i];
  }
  for (int k = 0; k < n; k++) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }
    }
  }
  int ans = 0;
  for (int i = 0; i < m; i++) {
    if (c[i] > dist[a[i]][b[i]]) ans++;
  }
  cout << ans << endl;
}
