#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<functional>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int> > mati;
typedef vector<vector<double> > matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cout << VEC[i] << " ";
  }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i, MAT.size()){
    REP(j, MAT[i].size()){
      cout << MAT[i][j] << " ";
    }
    cout << "\n";
  }
};

template <typename CLASS1, typename CLASS2>
class HOGE{
  public:
    CLASS1 key;
    CLASS2 value;
    HOGE(void){
      return;
    };
    HOGE(CLASS1 key, CLASS2 value){
      this->key = key;
      this->value = value;
    };
    ~HOGE(void){
      return;
    };

    void print(void){
      cout << "key : " << key << ", value : " << value << "\n";
      return;
    };
    
    bool operator==(const HOGE &obj){
      return (this->value == obj.value);
    };
    bool operator<(const HOGE &obj){
      return (this->value < obj.value);
    };
    bool operator>(const HOGE &obj){
      return (this->value > obj.value);
    };
};

class Dijkstra{
  //Dijkstra algorithm
  //calculation time complexity: O(|W| log |V|)
  //useful without negative cost
  private:
    struct edge { int to, cost; };
    typedef pair<int, int> P; //first is the shortest distance, second is the number of vertex

    int V, E;
    vector<int> d;
    vector<int> prev;
    vector<vector<edge> > G;

  public:
    Dijkstra(int V, vector<int> From, vector<int> To, vector<int> Cost){
      //num of vertex
      this->V = V;
      d.resize(V, INT_MAX);
      prev.resize(V, -1);
      E = From.size();
      if(To.size() != E || Cost.size() != E){
        fprintf(stderr, "Sizes are different, %d %d %d\n", From.size(), To.size(), Cost.size());
        exit(0);
      }
      G.resize(V);
      for(int i=0; i<E; ++i){
        edge tmp_forward = {To[i], Cost[i]};
        G[From[i]].push_back(tmp_forward);
      }
      return;
    };

    ~Dijkstra(void){
      return;
    };

    //calculate shortest path from s vertex to others
    void shortest_path(int s){
      priority_queue<P, vector<P>, greater<P> > que;
      for(int i=0; i<V; ++i) d[i] = INT_MAX;
      d[s] = 0;
      que.push(P(0, s));

      while(!que.empty()){
        P p = que.top(); que.pop();
        int v = p.second;
        if(d[v] < p.first) continue;
        for(int i=0; i<G[v].size(); i++){
          edge e = G[v][i];
          if(d[e.to] > d[v] + e.cost){
            d[e.to] = d[v] + e.cost;
            prev[e.to] = v;
            que.push(P(d[e.to], e.to));
          }
        }
      }
      return;
    };

    int get_distance(int vertex){
      return d[vertex];
    };

    //shortest path to vertex t
    vector<int> get_path(int t){
      vector<int> path;
      for(; t!=-1; t=prev[t]){
        path.push_back(t);
      }
      reverse(path.begin(), path.end());
      return path;
    };
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  int N, M;
  cin >> N >> M;
  vector<int> From(2*M), To(2*M), Cost(2*M);
  vector<vector<int>> flag(N, vector<int>(N, false));
  REP(i, M){
    cin >> From[i] >> To[i] >> Cost[i];
    From[i]--;
    To[i]--;
    From[M+i] = To[i];
    To[M+i] = From[i];
    Cost[M+i] = Cost[i];
    flag[From[i]][To[i]] = true;
    flag[To[i]][From[i]] = true;
  }

  for(int start=0; start<N; ++start){
    Dijkstra D(N, From, To, Cost);
    D.shortest_path(start);
    for(int end=start+1; end<N; ++end){
      vector<int> D_path = D.get_path(end);
      for(int i=0; i<D_path.size()-1; ++i){
        flag[D_path[i]][D_path[i+1]] = false;
        flag[D_path[i+1]][D_path[i]] = false;
      }
    }
  }

  int ans=0;
  for(int i=0; i<N; ++i){
    for(int j=i+1; j<N; ++j){
      if(flag[i][j]) ans++;
    }
  }

  cout << ans << "\n";

  return 0;
}

Measured memory_bytes: 384