#include <bits/stdc++.h>
using namespace std;

// 変数ダンプ先。coutかcerr
#define DUMPOUT cerr

// 提出時はコメントアウト
#define DEBUG_

// #define int long long
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;

/* cpp template {{{ */

/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto&& i : n)

/* debug */
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; cin >> x; return x;}
inline ll IN() {ll x; cin >> x; return x;}
inline vs split(const string& t, char c) {vs v; stringstream s(t); string b; while(getline(s, b, c)) v.eb(b); return v;}
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
template <typename T, typename S> inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << endl;}
template <typename T> inline void print(const T& x) {cout << x << '\n';}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v) {for (auto&& p : v) print(p);}
template <typename T> inline void print(const vector<T>& v, string s = " ") {REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");}
// clang-format on
/* }}} */

#ifdef DEBUG_
#define DEB
#else
// DEB と打つとデバッグ時以外はコメントアウトになる
#define DEB /##/
#endif

// 変数ダンプ用マクロ。デバッグ時以外は消滅する
// 引数はいくつでもどんな型でも可（ストリーム出力演算子があればOK）
#define dump(...) DEB DUMPOUT<<"  "; \
DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl; \
DUMPOUT<<"    "; \
dump_func(__VA_ARGS__)

// デバッグ用変数ダンプ関数
void dump_func() {
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&&... tail)
{
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) {
        DUMPOUT << " ";
    }
    else {
        DUMPOUT << ", ";
    }
    dump_func(std::move(tail)...);
}

// vector出力
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
    os << "{";
    for (int i = 0; i<vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}

signed main() {
    int N, M;
    cin >> N >> M;
    int cost[100][100];
    vector<int> route[100][100];
    int m[100][100]; // i-j no saitan
    int cost_max = 0;
    REP(i, N){
        REP(j, N){
            if (i == j) {
                cost[i][j] = 0;
            }
            else {
                cost[i][j] = -1;
                cost[j][i] = -1;
            }
            vector<int> v;
            route[i][j] = v;
        }
    }
    REP(i, M){
        int a, b, c;
        cin >> a >> b >> c;
        cost[a-1][b-1] = c;
        route[a-1][b-1].push_back(i);
        cost[b-1][a-1] = c;
        route[b-1][a-1].push_back(i);
        cost_max += c;
    }
    REP(i, N){
        REP(j, N){
            if (i == j) {
                m[i][j] = 0;
            }
            else if (cost[i][j] != -1){
                m[i][j] = cost[i][j];
            }
            else {
                m[i][j] = cost_max;
            }
        }
    }

    REP(k,N){
        REP(i,N){
            REP(j,N){
//                dump(i, j, k, m[i][k], m[k][j], m[i][j]);
                if (m[i][k] + m[k][j] < m[i][j]) { // m[i][j] = min(m[i][j], m[i][k]+m[k][j]);
                    m[i][j] = m[i][k] + m[k][j];
//                    print("route change");
//                    print(route[i][j]);
//                    print(route[i][k]);
//                    print(route[k][j]);
                    vector<int> new_route(0);
                    new_route.insert(new_route.end(), route[i][k].begin(), route[i][k].end());
                    new_route.insert(new_route.end(), route[k][j].begin(), route[k][j].end());
                    route[i][j] = new_route;
//                    print(route[i][j]);
                }
            }
        }
    }

    map<int, int> edge_count;
    REP(i, M){
        edge_count[i] = 0;
    }

    REP(i, N){
        REP(j, N){
            if (i < j) {
                for (auto itr = route[i][j].begin(); itr != route[i][j].end(); ++itr) {
                    int edge_i = *itr;
                    edge_count[edge_i] += 1;
                }
            }
        }
    }

    int ans = 0;

    REP(i, M){
        if (edge_count[i] == 0) {
            ans += 1;
        }
    }

    print(ans);

    return 0;
}

// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々

Measured memory_bytes: 2048