#include <bits/stdc++.h>
using namespace std;
// BRO
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;

#define pb push_back
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define FOR(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define ROF(i, a, b) for (int i = (int)a-1; i >= (int)b; --i)
#define ENDL '\n'
#define __   ios_base::sync_with_stdio(0); cin.tie(nullptr);

int main() { __
  int n, m;
  cin >> n >> m;
  vector<vector<pi>> g(n, vector<pi>());
  FOR (i, 0, m) {
    int u, v, w;
    cin >> u >> v >> w;
    g[u].pb({v, w});
    g[v].pb({u, w});
  }
  vector<vector<int>> d(n);
  FOR (x, 0, 3) {
    priority_queue<pi> pq;
    pq.push({0, x});
    vector<int> dist(n, 1e9);
    dist[x] = 0;
    while (!pq.empty()) {
      auto [w, u] = pq.top();
      w = -w;
      pq.pop();

      if (w > dist[u])
        continue;
      
      for (auto &[v, ww] : g[u]) {
        if (w + ww >= dist[v])
          continue;
        dist[v] = w + ww;
        pq.push({-dist[v], v});
      }
    }
    FOR (i, 0, n)
      d[i].pb(dist[i]);
  }

  FOR (i, 0, n)
    sort(ALL(d[i]));
  sort(ALL(d));
  
  map<pair<int, int>, int> m1;
  map<int, pair<int, int>> m2, m3;
  FOR (i, 0, n) {
    pi p = {d[i][1], d[i][2]};
    if (!m1.count(p) || m1[p] > d[i][0])
      m1[p] = d[i][0];
    p = {d[i][0], d[i][1]};
    if (!m2.count(d[i][2]) || m2[d[i][2]] > p)
      m2[d[i][2]] = p;
    p = {d[i][1], d[i][0]};
    if (!m3.count(d[i][2]) || m3[d[i][2]] > p)
      m3[d[i][2]] = p;  
  }

  int ans = 0;
  FOR (i, 0, n) {
    pi p = {d[i][1], d[i][2]};
    if (m1[p] < d[i][0])
      continue;
    p = {d[i][0], d[i][1]};
    pi p2 = m2[d[i][2]], p3 = m3[d[i][2]];
    swap(p3.first, p3.second);
    if (p > p2 || p > p3)
      continue;
    ans++;
  }
  cout << ans << ENDL;

  return 0;
}