#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  vector<int> a(n), b(n), c(n);
  vector<vector<int>> dist(n, vector<int>(n, 1e7));
  for (int i = 0; i < (n); i++) dist[i][i] = 0;
  for (int i = 0; i < (m); i++) {
    cin >> a[i] >> b[i] >> c[i];
    a[i]--;
    b[i]--;
    dist[a[i]][b[i]] = c[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++) {
    bool isCandidate = false;
    for (int s = 0; s < (n); s++)
      for (int t = 0; t < (n); t++) {
        if (s == t) continue;
        if (dist[s][t] == dist[s][a[i]] + c[i] + dist[b[i]][t]) {
          isCandidate = true;
        }
      }
    ans += !isCandidate;
  }
  cout << ans << endl;
}
