#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0)
#define so sizeof
#define pb push_back
#define cl clear() ;
#define vl vector<ll>
#define sz size()
#define len length()
#define emp empty()
#define el endl;cout.flush()
#define be begin()
#define fi first
#define se second
#define br break
#define en end()
#define ro return 0
#define br break
#define eb emplace_back
#define con continue
#define ms(x) memset(x , 0, so x)
#define all(x) (x).be , (x).en
#define acc(x) accumulate((x).be , (x).en , 0ll)
#define forn(i,a,b) for(ll i=a;i<=b;++i)
#define rng_58 mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define vll vector<pair<ll,ll> >
#define pll pair<ll,ll>
#define plll pair<ll,pair<ll,ll>>
#define plvl pair<pair<ll,ll> ,ll>
#define mp make_pair
#define trace3(a,b,c) cerr <<"a is " << a << " b is " << b << " c is " << c << el;
#define trace4(a,b,c,d) cerr <<"a is " << a << " b is " << b << " c is " << c <<" d is " << d << el ;
#define trace5(a,b,c,d,e) cerr <<"a is " << a << " b is " << b << " c is " << c <<" d is " << d << " e is " << e << el;
#define trace6(a,b,c,d,e,f) cerr <<"a is " << a << " b is " << b << " c is " << c <<" d is " << d << " e is " << e << " f is " << f << el ;

ll dist[103][103] , ans[103][103];
ll n , m ;
const ll inf = 1e9 ;
void flloyd()
{
    for(ll k=1;k<=n;++k){
        for(ll i = 1;i<=n;++i){
            for(ll j=1;j<=n;++j){
                ans[i][j] = min(ans[i][j] , dist[i][k] + dist[k][j]);
                ans[j][i] = ans[i][j] ;
            }
        }
    }
}
int main()
{
   ios;
   cin >> n >> m ;
   forn(i , 0 , 102) {
      forn(j , 0 , 102){
         if(i == j) {
            dist[i][j] = 0;
            dist[j][i] = 0 ;
         }
         else {
            dist[i][j] = inf;
            dist[j][i] = inf;
         }
      }
   }
   forn(i , 1 , m ) {
      ll x , y , z ;
      cin >> x >> y >> z;
      dist[x][y] = z ;
      dist[y][z] = z ;
   }
   flloyd();
   ll cnt = 0 ;
   forn(i , 1 , n ) {
      forn(j , i + 1 , n ) {
         if(dist[i][j] == inf) con ;
         else {
            if(dist[i][j] != ans[i][j]) ++cnt;
         }
      }
   }
   cout << cnt << el ;
   ro ;
}


























