c++.h"

using namespace std;

#define ll long long
#define vi  vector<int>
#define vvi vector<vi>
#define pi  pair<int,int>
#define mp  make_pair
#define pb  push_back
#define MOD 1e9 + 7
#define PAI  3.1415
#define all(x) (x).begin(),(x).end()
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
#define pr(x) cout << x << endl
#define Endl endl
#define rep(i,n) for(int i = 0 ; i < n; i++)

const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
const int ddx[8] = {-1,0,1,-1,1,-1,0,1};
const int ddy[8] = {-1,-1,-1,0,0,1,1,1};
const int inf = 99999999;
const ll linf = 1LL << 62;

ll gcd(ll a,ll b){
  if(a < b)swap(a , b);
  if(a % b == 0) return b;
  else gcd(b, a%b);
}

ll lcm(ll a,ll b){
  if(a < b)swap(a , b);
  return (a/gcd(a , b))*b;
}

int main(){

  int n,m;
  cin >> n >> m;

  int a[1000],b[1000],c[1000],dist[100][100] = {0};

  for(int i = 0 ; i < m ; i++){
    cin >> a[i] >> b[i] >> c[i];
    a[i]--; b[i]--;
  }

  rep(i,n){
    rep(j,n){
       if(i != j)dist[i][j] = inf;
    }
  }

  rep(i,m){
    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]);
  }

  rep(k,n){
    rep(i,n){
      rep(j,n){
        dist[i][j] = min(dist[i][j],dist[i][k] + dist[k][j]);
      }
    }
  }

  int ans = m;
  rep(i,m){
    bool flag = false;
    rep(j,n) if(dist[j][a[i]]+c[i] == dist[j][b[i]])flag = true;
    if(flag) ans--;
  }

  pr(ans);

  return 0;

}
