#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 29;
const ll INF64 = 1ll << 62;
const int mod = 1000000007;
template <class T>
inline bool chmin(T &a, const T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, const T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline void line_out(const vector<T> vec) {
  int n = ((int)(vec).size());
  for (int i = 0; i < n; ++i) {
    cout << vec[i];
    if (i < n - 1) cout << " ";
  }
  cout << endl;
  return;
}
struct mint {
  ll x;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint &operator++() {
    if ((x += 1) >= mod) x -= mod;
    return *this;
  }
  mint &operator--() {
    if ((x += mod - 1) >= mod) x -= mod;
    return *this;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
};
int main() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>> g(n + 1, vector<int>(n + 1, INF));
  vector<vector<bool>> flag(n + 1, vector<bool>(n + 1, false));
  for (int i = 0; i < m; ++i) {
    int a, b, c;
    cin >> a >> b >> c;
    g[a][b] = c;
    g[b][a] = c;
    flag[a][b] = true;
    flag[b][a] = true;
  }
  for (int k = 1; k <= n; ++k) {
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        if (g[i][j] >= g[i][k] + g[k][j]) {
          flag[i][j] = false;
          g[i][j] = g[i][k] + g[k][j];
        }
      }
    }
  }
  int use = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j)
      if (flag[i][j]) ++use;
  }
  cout << m - use / 2 << endl;
}
