#pragma GCC optimize ("O3")

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <list>
using namespace std;

using QWORD  = uint64_t;
using SQWORD = int64_t;
using DWORD  = uint32_t;
using SDWORD = int32_t;
using WORD   = uint16_t;
using SWORD  = int16_t;
using BYTE   = uint8_t;
using SBYTE  = int8_t;
using DOUBLE = double;
using FLOAT  = float;

#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)

#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)

#define MAX_QWORD  (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD  (0xFFFFFFFF)
#define MAX_WORD   (0xFFFF)
#define MAX_BYTE   (0xFF)

#define MAX_DOUBLE      (1.0e+308)
#define DOUBLE_EPS      (1.0e-12)
#define MIN_DOUBLE_N    (-1.0e+308)

#define ArrayLength(a)  (sizeof(a) / sizeof(a[0]))

static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }

#define BYTE_BITS   (8)
#define WORD_BITS   (16)
#define DWORD_BITS  (32)
#define QWORD_BITS  (64)

static inline void inputStringSpSeparated(char *pcStr)
{
    char *pcCur = pcStr;
    for (;;) {
        char c = getchar();
        if (('\n' == c) || (EOF == c) || (' ' == c)) {
            break;
        }
        *pcCur = c;
        pcCur++;
    }
    *pcCur = '\0';
}

static inline void inputString(char *pcStr)
{
    char *pcCur = pcStr;
    for (;;) {
        char c = getchar();
        if (('\n' == c) || (EOF == c)) {
            break;
        }
        *pcCur = c;
        pcCur++;
    }
    *pcCur = '\0';
}


static inline SQWORD inputSQWORD(void)
{
    SQWORD sqNumber = 0;
    SQWORD sqMultiplier = 1;
    bool bRead = false;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                sqMultiplier = -1;
            }
        }
        if (('0' <= c) && (c <= '9')) {
            sqNumber *= 10LL;
            sqNumber += (SQWORD)(c - '0');
            bRead = true;
        } else {
            if (bRead) {
                return sqNumber * sqMultiplier;
            }
        }
    }
}


static inline SDWORD inputSDWORD(void)
{
    SDWORD lNumber = 0;
    SDWORD lMultiplier = 1;
    bool bRead = false;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                lMultiplier = -1;
            }
        }
        if (('0' <= c) && (c <= '9')) {
            lNumber *= 10;
            lNumber += (c - '0');
            bRead = true;
        } else {
            if (bRead) {
                return lNumber * lMultiplier;
            }
        }
    }
}

static inline DOUBLE inputFP(void)
{
    DOUBLE dInt = 0.0;
    DOUBLE dFrac = 0.0;
    DOUBLE dMultiplier = 1.0;
    DWORD dwFpCnt = 0;
    DOUBLE *pdCur = &dInt;
    bool bRead = false;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                dMultiplier = -1;
            }
        }
        if ('.' == c) {
            pdCur = &dFrac;
        } else if (('0' <= c) && (c <= '9')) {
            (*pdCur) *= 10;
            (*pdCur) += (DOUBLE)(c - '0');
            bRead = true;
            if (pdCur == &dFrac) {
                dwFpCnt++;
            }
        } else {
            if (bRead) {
                return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));
            }
        }
    }
}

/*----------------------------------------------*/
/**
 *  mod による操作ライブラリ
 */
#define ANS_MOD (1000000007)

class MODINT {
    static SQWORD MOD;
    SQWORD m_x;

public:
    MODINT(SQWORD val) {
        m_x = (val % MOD + MOD) % MOD;
    };
    MODINT() {
        m_x = 0;
    }
    static void Init(SQWORD sqMod) {
        MOD = sqMod;
    }

	MODINT& operator+= (const MODINT a)
    {
        m_x = (m_x + a.m_x) % MOD; 
        return *this;
    };
	MODINT& operator-= (const MODINT a)
    { 
        m_x = (m_x - a.m_x + MOD) % MOD; 
        return *this;
    };
	MODINT& operator*= (const MODINT a)
    {
        m_x = (m_x * a.m_x) % MOD;
        return *this;
    };
    MODINT pow(SQWORD t) const {
        if (!t) return 1;
        MODINT a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
	MODINT operator+ (const MODINT a) const {
		MODINT res(*this);
		return (res += a);
	}
	MODINT operator- (const MODINT a) const {
		MODINT res(*this);
		return (res -= a);
	}
	MODINT operator* (const MODINT a) const {
		MODINT res(*this);
		return (res *= a);
	}
	MODINT operator/ (const MODINT a) const {
		MODINT res(*this);
		return (res /= a);
	}

    /* 逆元 */
    MODINT inv() const {
        return pow(MOD-2);
    }

    /* 除算 */
    MODINT& operator/=(const MODINT a) {
        return (*this) *= a.inv();
    } 

    /* 整数版 */
	MODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};
	MODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};
	MODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};
	MODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};

    SQWORD getVal() { return m_x; };
};
SQWORD MODINT::MOD = ANS_MOD;


/*----------------------------------------------*/

struct EDGE {
    SQWORD sqTo;
    SQWORD sqD;
    SQWORD sqIdx;

    EDGE(SQWORD t, SQWORD d, SQWORD i) : sqTo(t), sqD(d), sqIdx(i) {};
};

#define SQWORD_INF      (100100100100100100)

static bool dfs(
    const vector<vector<EDGE>> &vvE, 
    vector<bool> &vbIsUsed, 
    vector<SQWORD> &vsqPos,
    SQWORD sqCur)
{
    for (auto e: vvE[sqCur]) {
        if (!vbIsUsed[e.sqIdx]) {
            vbIsUsed[e.sqIdx] = true;

            SQWORD sqNextPos = vsqPos[sqCur] + e.sqD;

            if (SQWORD_INF == vsqPos[e.sqTo]) {
                vsqPos[e.sqTo] = sqNextPos;
                if (!dfs(vvE, vbIsUsed, vsqPos, e.sqTo)) {
                    return false;
                }
            } else {
                if (vsqPos[e.sqTo] != sqNextPos) {
                    return false;
                }
            }
        }
    }
    return true;
}

/*----------------------------------------------*/

struct EDGE_ST {
    SQWORD sqTo;
    SQWORD sqCost;
    SQWORD sqIdx;

    EDGE_ST(SQWORD to, SQWORD cost, SQWORD idx) {
        sqTo = to;
        sqCost = cost;
        sqIdx = idx;
    };
};

#define VERTEX_INVALID  (1001001001)

bool solveDijkstra(
    SQWORD sqFrom, 
    const vector<vector<EDGE_ST>> &vvEdges,
    vector<SQWORD> &cost,
    SQWORD sqRemoveEdgeIdx)
{
    typedef pair<SQWORD, SQWORD> P;
    priority_queue<P, vector<P>, greater<P>> que;

    que.push(P(0, sqFrom));

    while (!que.empty()) {
        P p = que.top();
        que.pop();

        SDWORD v = p.second;
        if (p.first <= cost[v]) {
            for (SDWORD lIdx = 0; lIdx < vvEdges[v].size(); lIdx++) {
                EDGE_ST e = vvEdges[v][lIdx];
                SQWORD sqECost = e.sqCost;
                if (e.sqIdx == sqRemoveEdgeIdx) {
                    sqECost--;
                }

                if (cost[e.sqTo] > cost[v] + sqECost) {
                    if (-1 == sqRemoveEdgeIdx) {
                        cost[e.sqTo] = cost[v] + sqECost;
                        que.push(P(cost[e.sqTo], e.sqTo));
                    } else {
                        return false;
                    }
                }
            }
        }
    }
    return true;
}

struct EDGE_DEFINE_ST {
    SQWORD sqA;
    SQWORD sqB;
    SQWORD sqC;
    EDGE_DEFINE_ST(SQWORD a, SQWORD b, SQWORD c) : sqA(a), sqB(b), sqC(c) {};
};

static bool solveSinglePattern(
    SQWORD sqVMax,
    const vector<vector<EDGE_ST>> &vvEdge,
    vector<vector<SQWORD>> &vvCost,
    SQWORD sqRemoveEdgeIdx)
{
    for (SQWORD sqStartIdx = 1; sqStartIdx < sqVMax; sqStartIdx++) {
        if (-1 == sqRemoveEdgeIdx) {
            vvCost[sqStartIdx][sqStartIdx] = 0;
        }

        if (!solveDijkstra(sqStartIdx, vvEdge, vvCost[sqStartIdx], sqRemoveEdgeIdx)) {
            return false;
        }
    }

    return true;
}


int main(void)
{
    SQWORD sqN = inputSQWORD();
    SQWORD sqM = inputSQWORD();

    vector<vector<EDGE_ST>> vvE(sqN + 1);

    for (SQWORD sqIdx = 0; sqIdx < sqM; sqIdx++) {
        SQWORD sqA = inputSQWORD();
        SQWORD sqB = inputSQWORD();
        SQWORD sqC = inputSQWORD();
        vvE[sqA].emplace_back(sqB, sqC, sqIdx);
        vvE[sqB].emplace_back(sqA, sqC, sqIdx);
    }

    SQWORD sqMaxV = sqN + 1;

    vector<vector<SQWORD>> vvCostOrg(sqMaxV, vector<SQWORD>(sqMaxV, SQWORD_INF));
    solveSinglePattern(sqMaxV, vvE, vvCostOrg, -1);

    SQWORD sqAns = 0;
    for (SQWORD sqRemoveEdgeIdx = sqM - 1; 0 <= sqRemoveEdgeIdx; sqRemoveEdgeIdx--) {
        if (solveSinglePattern(sqMaxV, vvE, vvCostOrg, sqRemoveEdgeIdx)) {
            sqAns++;
        }
    }

    printf("%lld\n", sqAns);

    return 0;
}

Measured memory_bytes: 384