import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum mod = 10L^^9 + 7;
enum inf = 10^^9;

void main() {
    int n, m;
    scan(n, m);

    auto c = new int[][](n, n);
    foreach (i ; 0 .. n) {
        foreach (j ; 0 .. n) {
            if (i != j) {
                c[i][j] = inf;
            }
        }
    }

    foreach (i ; 0 .. m) {
        int ai, bi, ci;
        scan(ai, bi, ci);
        ai--, bi--;
        c[ai][bi] = c[bi][ai] = ci;
    }

    auto dist = new int[][](n, n);
    foreach (i ; 0 .. n) {
        foreach (j ; 0 .. n) {
            dist[i][j] = c[i][j];
        }
    }

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

    int ans;
    foreach (i ; 0 .. n) {
        foreach (j ; i + 1 .. n) {
            if (c[i][j] == inf) continue;
            if (c[i][j] > dist[i][j]) {
                ans++;
            }
        }
    }

    writeln(ans);
}























void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}