#include<bits/stdc++.h>
using std::cin, std::cout;
using ll = long long;
using u64 = unsigned long long;
namespace rgs = std::ranges;
const int N = 2005;
const int inf = 1e9;
struct edge { int to, v; };
std::vector<edge> e[N];

int dist[N][N];
std::bitset<N> M[N], iM[N];
int vis[N];


int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	int n, m;
	cin >> n >> m;
	for(int i = 0;i < m;++i) {
		int u, v, w;
		cin >> u >> v >> w;
		e[u].push_back({v, w});
	}
	for(int i = 1;i <= n;++i) {
		using pr = std::pair<int, int>;
		std::priority_queue<pr, std::vector<pr>, std::greater<pr>> Q;
		for(int j = 1;j <= n;++j) {
			dist[i][j] = inf;
			vis[j] = 0;
		}
		auto relax = [&](int x, int v) {
			if(dist[i][x] > v) {
				dist[i][x] = v;
				Q.emplace(v, x);
			}
		};
		relax(i, 0);
		for(;Q.size();) {
			int x = Q.top().second; Q.pop();
			if(vis[x]) continue;
			vis[x] = 0;
			for(auto [to, w] : e[x]) {
				relax(to, w + dist[i][x]);
			}
		}
	}
	for(int i = 1;i <= n;++i) {
		M[i].set(i);
		iM[i].set(i);
		for(auto [to, w] : e[i]) {
			if(w == dist[i][to]) {
				M[i].set(to);
				iM[to].set(i);
			}
		}
		for(int j = 1;j <= n;++j) if(dist[i][j] == inf) {
			M[i].set(j);
			iM[j].set(i);
		}
	}
	int ans = 0;
	for(int y = 1;y <= n;++y) {
		for(int z = 1;z <= n;++z) {
			if((M[y] & iM[z]).any()) {
				M[y].set(z);
				iM[z].set(y);
			}
			ans += !M[y].test(z);
		}
	}
	cout << ans << '\n';
}