#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 2020;
const int inf = 0x3f3f3f3f;

int n, m, f[maxn][maxn];
bitset<maxn> b[maxn], in[maxn], out[maxn];
bool vis[maxn];
vector<pii> G[maxn];

struct node {
	int u, d;
	node(int a = 0, int b = 0) : u(a), d(b) {}
};

inline bool operator < (const node &a, const node &b) {
	return a.d > b.d;
}

inline void dij1(int S, int *f) {
	priority_queue<node> pq;
	mems(vis, 0);
	pq.emplace(S, 0);
	f[S] = 0;
	while (pq.size()) {
		int u = pq.top().u;
		pq.pop();
		if (vis[u]) {
			continue;
		}
		vis[u] = 1;
		for (pii p : G[u]) {
			int v = p.fst, d = p.scd;
			if (f[v] > f[u] + d) {
				f[v] = f[u] + d;
				if (!vis[v]) {
					pq.emplace(v, f[v]);
				}
			}
		}
	}
	for (pii p : G[S]) {
		if (p.scd == f[p.fst]) {
			out[S].set(p.fst);
			in[p.fst].set(S);
		}
	}
}

inline void dij2(int S, int *f) {
	priority_queue<node> pq;
	mems(vis, 0);
	pq.emplace(S, 0);
	f[S] = 0;
	while (pq.size()) {
		int u = pq.top().u;
		pq.pop();
		if (vis[u]) {
			continue;
		}
		vis[u] = 1;
		for (pii p : G[u]) {
			int v = p.fst, d = p.scd;
			if (f[v] > f[u] + d) {
				f[v] = f[u] + d;
				b[v] = b[u];
				// printf("%d %d\n", u, v);
				if (u != S) {
					b[v].set(u);
				}
				if (!vis[v]) {
					pq.emplace(v, f[v]);
				}
			} else if (f[v] == f[u] + d) {
				b[v] |= b[u];
				if (u != S) {
					b[v].set(u);
				}
			}
		}
	}
}

void solve() {
	scanf("%d%d", &n, &m);
	while (m--) {
		int u, v, d;
		scanf("%d%d%d", &u, &v, &d);
		G[u].pb(v, d);
	}
	mems(f, 0x3f);
	for (int i = 1; i <= n; ++i) {
		dij1(i, f[i]);
	}
	mems(f, 0x3f);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			b[j].reset();
		}
		dij2(i, f[i]);
		// for (int j = 1; j <= n; ++j) {
			// for (int k = 1; k <= n; ++k) {
				// printf("%d%c", b[j].test(k), " \n"[k == n]);
			// }
		// }
		// putchar('\n');
		for (int j = 1; j <= n; ++j) {
			if ((b[j] & out[i] & in[j]).any()) {
				out[i].set(j);
				in[j].set(i);
			}
		}
	}
	int ans = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (i != j && f[i][j] != inf && !out[i].test(j)) {
				// printf("%d %d\n", i, j);
				++ans;
			}
		}
	}
	printf("%d\n", ans);
}

int main() {
	// freopen("floyd.in", "r", stdin);
	// freopen("floyd.out", "w", stdout);
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}