#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
  int n, m;
  cin >> n >> m;
  int a[1010], b[1010], c[1010], dist[110][110];
  for (int i = 0; i < m; ++i) {
    cin >> a[i] >> b[i] >> c[i];
  }
  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) {
    dist[a[i]][b[i]] = min(dist[a[i]][b[i]], c[i]);
    dist[b[i]][a[i]] = min(dist[b[i]][a[i]], c[i]);
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      for (int k = 0; k < n; ++k) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }
    }
  }
  int ans = m;
  for (int i = 0; i < m; ++i) {
    bool shortest = false;
    for (int j = 0; j < n; ++j) {
      if (dist[j][a[i]] + c[i] == dist[j][b[i]]) shortest = true;
      if (shortest) ans--;
    }
  }
  cout << ans << endl;
  return 0;
}
