#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
long long gcd(long long x, long long y) {
  if (y == 0)
    return x;
  else
    return gcd(y, x % y);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool is_prime(int n) {
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return n != 1;
}
map<int, int> prime_factor(int n) {
  map<int, int> res;
  for (int i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      ++res[i];
      n /= i;
    }
  }
  if (n != 1) res[n] = 1;
  return res;
}
int extgcd(int a, int b, int& x, int& y) {
  int d = a;
  if (b != 0) {
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  } else {
    x = 1;
    y = 0;
  }
  return d;
}
long long mod_pow(long long x, long long n, long long mod) {
  if (n == 0) return 1;
  long long res = mod_pow(x * x % mod, n / 2, mod);
  if (n & 1) res = res * x % mod;
  return res;
}
vector<string> split(const string& str, char delim) {
  vector<string> res;
  size_t current = 0, found;
  while ((found = str.find_first_of(delim, current)) != string::npos) {
    res.push_back(string(str, current, found - current));
    current = found + 1;
  }
  res.push_back(string(str, current, str.size() - current));
  return res;
}
bool is_kadomatsu(int a, int b, int c) {
  if (a == b || a == c || b == c) return false;
  if (a > b && c > b) return true;
  if (a < b && c < b) return true;
  return false;
}
struct UF {
  int n;
  vector<int> d;
  UF() {}
  UF(int n) : n(n), d(n, -1) {}
  int root(int v) {
    if (d[v] < 0) return v;
    return d[v] = root(d[v]);
  }
  bool unite(int x, int y) {
    x = root(x);
    y = root(y);
    if (x == y) return false;
    if (size(x) < size(y)) swap(x, y);
    d[x] += d[y];
    d[y] = x;
    return true;
  }
  int size(int v) { return -d[root(v)]; }
};
vector<int> divisor(int n) {
  if (n == 1) return {};
  vector<int> res;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      res.emplace_back(i);
      if (i != 1 && i != n / i) res.emplace_back(n / i);
    }
  }
  return res;
}
double get_length(double x, double y) { return sqrt(x * x + y * y); }
double product(double x1, double y1, double x2, double y2) {
  return x1 * x2 + y1 * y2;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  bool ans[101][101];
  memset(ans, 0, sizeof(ans));
  int path[101][101];
  memset(path, 0, sizeof(path));
  int N, M;
  cin >> N >> M;
  vector<pair<int, int>> G[101];
  int aa[101], bb[101], cc[101];
  for (int i = (0); i < (M); ++i) {
    int a, b, c;
    cin >> a >> b >> c;
    a--;
    b--;
    aa[i] = a;
    bb[i] = b;
    cc[i] = c;
    G[a].emplace_back(b, c);
    G[b].emplace_back(a, c);
  }
  for (int i = 0; i < N; i++) {
    int d[101];
    for (int k = (0); k < (101); ++k) d[k] = 1000000;
    d[i] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>,
                   greater<pair<int, int>>>
        que;
    que.push(make_pair(0, i));
    while (!que.empty()) {
      pair<int, int> p = que.top();
      que.pop();
      int v = p.second;
      for (auto t : G[v]) {
        if (d[t.first] > d[v] + t.second) {
          d[t.first] = d[v] + t.second;
          que.push(make_pair(d[t.first], t.first));
          ans[v][t.first] = true;
        } else if (d[t.first] == d[v] + t.second) {
          ans[v][t.first] = true;
        }
      }
    }
    for (int j = (0); j < (N); ++j) {
      path[i][j] = d[j];
    }
  }
  int ansa = M;
  for (int i = (0); i < (M); ++i) {
    bool tt = false;
    for (int j = (0); j < (N); ++j) {
      if (path[j][aa[i]] + cc[i] == path[j][bb[i]]) tt = true;
    }
    if (tt) ansa--;
  }
  cout << (ansa) << endl;
  ;
  return 0;
}
