#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
template <typename Head>
void dump_1(const char* str, Head&& h) {
  cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char* str, Head&& h, Tail&&... t) {
  while (*str != ',') {
    cerr << *str++;
  }
  cerr << ": " << h << ' ';
  dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char* str, const T v[], const ll size) {
  while (*str != ',') {
    cerr << *str++;
  }
  cerr << ": ";
  for (ll i = 0; i < (size); i++) {
    if (i != 0) {
      cerr << ' ';
    }
    cerr << v[i];
  }
  cerr << '\n';
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& v) {
  os << v.first << ' ' << v.second;
  return os;
}
template <typename T1, typename T2, typename T3>
ostream& operator<<(ostream& os, const tuple<T1, T2, T3>& v) {
  os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ' ';
    }
    os << *it;
  }
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ' ';
    }
    os << *it;
  }
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ' ';
    }
    os << *it;
  }
  return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const map<T1, T2>& v) {
  os << '{';
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ", ";
    }
    os << it->first << ':' << it->second;
  }
  os << '}';
  return os;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T& a, const T& b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
void vin(vector<T>& v, ll len) {
  for (ll i = 0; i < (len); i++) {
    cin >> v[i];
  }
}
template <typename Head>
void in_1(Head& h) {
  cin >> h;
}
template <typename Head, typename... Tail>
void in_1(Head& h, Tail&... t) {
  cin >> h;
  in_1(t...);
}
template <typename Head>
void print_1(Head&& h) {
  cout << h << '\n';
}
template <typename Head, typename... Tail>
void print_1(Head&& h, Tail&&... t) {
  cout << h << ' ';
  print_1(t...);
}
struct Dijkstra {
  ll N;
  vvpll to;
  vll cost;
  vll prev;
  priority_queue<tll> q;
  explicit Dijkstra(ll N) {
    this->N = N;
    this->to = vvpll(this->N);
  }
  void connect(ll from, ll to, ll length) {
    this->to[from].emplace_back(to, length);
  }
  void run(ll loc, ll cost = 0) {
    this->cost = vll(this->N, 1111111111111111111LL);
    this->prev = vll(this->N, -1);
    this->q.push(make_tuple(-cost, loc, -1));
    while (!this->q.empty()) {
      ll co, lo, pr;
      tie(co, lo, pr) = this->q.top();
      this->q.pop();
      co = -co;
      if (this->cost[lo] > co) {
        this->cost[lo] = co;
        this->prev[lo] = pr;
        for (pll& pa : this->to[lo]) {
          ll lo2 = pa.first;
          ll co2 = co + pa.second;
          this->q.push(make_tuple(-co2, lo2, lo));
        }
      }
    }
  }
  ll get(ll loc) { return this->cost[loc]; }
  ll get_prev(ll loc) { return this->prev[loc]; }
};
void solve() {
  ll N, M;
  in_1(N, M);
  Dijkstra di(N);
  map<pll, bool> use;
  for (ll i = 0; i < (M); i++) {
    ll a, b, c;
    in_1(a, b, c);
    --a;
    --b;
    di.connect(a, b, c);
    di.connect(b, a, c);
    if (a > b) swap(a, b);
    use[make_pair(a, b)] = false;
  }
  for (ll i = 0; i < (N); i++) {
    di.run(i);
    for (ll j = 0; j < (N); j++) {
      if (i == j) continue;
      ll j1 = j;
      ll j2 = 0;
      do {
        ll j2 = di.get_prev(j1);
        ll k1 = j1;
        ll k2 = j2;
        if (k1 > k2) swap(k1, k2);
        use[make_pair(k1, k2)] = true;
        j1 = j2;
      } while (j1 != i);
    }
  }
  ll ans = 0;
  for (auto pa : use) {
    if (!pa.second) {
      ans++;
    }
  }
  print_1(ans);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(16);
  cerr << fixed << setprecision(16);
  solve();
}
