// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=(a);i<=(b);i++)
#define dF(i,a,b) for(int i=(a);i>=(b);i--)
#define wh(lzm) while(lzm--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
using namespace std;
ll read(){
	ll x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*f;
}
const int mod=998244353,maxn=200005;
inline void chkmax(int &x,int y){ x=max(x,y); }
inline void chkmin(int &x,int y){ x=min(x,y); }
vector<pii>g[maxn];
int n,m,a[maxn],b[maxn],c[maxn],vis[maxn],lsh[maxn],tot;
void dij(int *d,int s){
	priority_queue<pii>q; 
	F(i,1,n) vis[i]=0,d[i]=inf;
	q.push(mkp(d[s]=0,s));
	while(!q.empty()){
		int u=q.top().se; q.pop();
		if(vis[u]) continue;
		vis[u]=1;
		for(auto it=g[u].begin();it!=g[u].end();++it){
			const int v=it->first,w=it->second;
			if(d[v]>d[u]+w) d[v]=d[u]+w,q.push(mkp(-d[v],v));
		}
	}
}
struct N1{
	int x,y,z;
	bool operator<(const N1 &rhs)const{
		if(x^rhs.x) return x<rhs.x;
		if(y^rhs.y) return y<rhs.y;
		return z<rhs.z;
	}
};
struct node{
	int x,y,z,id,siz;
	bool operator<(const node &rhs)const{
		if(x^rhs.x) return x<rhs.x;
		if(y^rhs.y) return y<rhs.y;
		return z<rhs.z;
	}
};
bool cmp(node A,node B){
	if(A.y^B.y) return A.y<B.y;
	if(A.z^B.z) return A.z<B.z;
	return A.x<B.x;
}
int fl[maxn];
vector<node>vec;
void Solve(int l,int r){
	if(l==r) return;
	int mid=(l+r)>>1;
	Solve(l,mid),Solve(mid+1,r);
	vector<node>A,B;
	F(i,l,mid) A.push_back(vec[i]);
	F(i,mid+1,r) B.push_back(vec[i]);
	sort(A.begin(),A.end(),cmp),sort(B.begin(),B.end(),cmp);
	int mn=inf,lsz=A.size(),rsz=B.size(),p=-1;
	F(i,0,rsz-1){
		for(;p+1<lsz&&A[p+1].y<=B[i].y;++p) chkmin(mn,A[p+1].z);
		if(mn<=B[i].z) fl[B[i].id]=1;
	}
}
void solve(){
	n=read(),m=read();
	F(i,1,m){
		int u=read(),v=read(),w=read();
		g[u].push_back(mkp(v,w)),g[v].push_back(mkp(u,w));
	}
	dij(a,1),dij(b,2),dij(c,3);
	tot=0; F(i,1,n) lsh[++tot]=a[i]; sort(lsh+1,lsh+tot+1),tot=unique(lsh+1,lsh+tot+1)-lsh-1; F(i,1,n) a[i]=lower_bound(lsh+1,lsh+tot+1,a[i])-lsh;
	tot=0; F(i,1,n) lsh[++tot]=b[i]; sort(lsh+1,lsh+tot+1),tot=unique(lsh+1,lsh+tot+1)-lsh-1; F(i,1,n) b[i]=lower_bound(lsh+1,lsh+tot+1,b[i])-lsh;
	tot=0; F(i,1,n) lsh[++tot]=c[i]; sort(lsh+1,lsh+tot+1),tot=unique(lsh+1,lsh+tot+1)-lsh-1; F(i,1,n) c[i]=lower_bound(lsh+1,lsh+tot+1,c[i])-lsh;
	map<N1,int>mp;
	F(i,1,n) ++mp[(N1){a[i],b[i],c[i]}];
	int m=0;
	for(auto it=mp.begin();it!=mp.end();++it) vec.push_back((node){it->first.x,it->first.y,it->first.z,m++,it->second});
	// F(i,0,m-1) printf("%d %d %d %d %d\n",vec[i].x,vec[i].y,vec[i].z,vec[i].id,vec[i].siz);
	Solve(0,m-1);
	int ans=0;
	F(i,0,m-1) if(!fl[i]) ans+=vec[i].siz;
	printf("%d",ans);
}
signed main(){
	int sjy=1;
	cmh(sjy) solve();
}