#include<bits/stdc++.h>
using namespace std;
int n,m;
vector<pair<int,int> >G[100005];
int dis[4][100005],vis[100005];
priority_queue<pair<int,int> >pq;
struct node{
    int a,b,c,ok;
    bool operator <(const node &o)const{
        return a<o.a;
    }
}d[100005];
int dc[100005];
vector<node>v[100005];
int mx[400005];
void update(int l,int r,int x,int pos,int val){
    if(l==r){
        mx[x]=min(mx[x],val);
        return;
    }
    int mid=(l+r)/2;
    if(pos<=mid)update(l,mid,x<<1,pos,val);
    else update(mid+1,r,x<<1|1,pos,val);
    mx[x]=min(mx[x<<1],mx[x<<1|1]);
}
int query(int l,int r,int x,int L,int R){
    if(L>R)return 0x3f3f3f3f;
    if(L<=l && r<=R)return mx[x];
    int mid=(l+r)/2,ans=0x3f3f3f3f;
    if(L<=mid)ans=min(ans,query(l,mid,x<<1,L,R));
    if(R>mid)ans=min(ans,query(mid+1,r,x<<1|1,L,R));
    return ans;
}
void build(int l,int r,int x){
    mx[x]=0x3f3f3f3f;
    if(l==r)return;
    int mid=(l+r)/2;
    build(l,mid,x<<1);
    build(mid+1,r,x<<1|1);
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        G[u].push_back({v,w});
        G[v].push_back({u,w});
    }
    memset(dis,0x3f,sizeof(dis));
    for(int s=1;s<=3;s++){
        dis[s][s]=0;
        memset(vis,0,sizeof(vis));
        pq.push({0,s});
        while(!pq.empty()){
            int f=pq.top().second;
            pq.pop();
            if(vis[f])continue;
            vis[f]=1;
            for(auto p:G[f]){
                int v=p.first,w=p.second;
                if(dis[s][f]+w<dis[s][v]){
                    dis[s][v]=dis[s][f]+w;
                    pq.push({-dis[s][v],v});
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        d[i].a=dis[1][i];
        d[i].b=dis[2][i];
        d[i].c=dis[3][i];
        // scanf("%d%d%d",&d[i].a,&d[i].b,&d[i].c);
        d[i].ok=1;
    }
    sort(d+1,d+n+1);
    for(int i=1;i<=n;i++)dc[i]=d[i].a;
    sort(dc+1,dc+n+1);
    int lena=unique(dc+1,dc+n+1)-dc-1;
    for(int i=1;i<=n;i++)d[i].a=lower_bound(dc+1,dc+lena+1,d[i].a)-dc;
    for(int i=1;i<=n;i++)dc[i]=d[i].b;
    sort(dc+1,dc+n+1);
    int lenb=unique(dc+1,dc+n+1)-dc-1;
    for(int i=1;i<=n;i++)d[i].b=lower_bound(dc+1,dc+lenb+1,d[i].b)-dc;
    for(int i=1;i<=n;i++)dc[i]=d[i].c;
    sort(dc+1,dc+n+1);
    int lenc=unique(dc+1,dc+n+1)-dc-1;
    for(int i=1;i<=n;i++)d[i].c=lower_bound(dc+1,dc+lenc+1,d[i].c)-dc;
    for(int i=1;i<=n;i++)v[d[i].a].push_back(d[i]);
    int ans=0;
    build(1,lenb,1);
    for(int i=1;i<=lena;i++){
        for(node &x:v[i]){
            // printf("%d %d %d\n",x.a,x.b,x.c);
            if(query(1,lenb,1,1,x.b)<=x.c)x.ok=0;
        }
        for(node &x:v[i])update(1,lenb,1,x.b,x.c);
        for(node &x:v[i]){
            if(query(1,lenb,1,1,x.b)<x.c || query(1,lenb,1,1,x.b-1)<=x.c)x.ok=0;
            ans+=x.ok;
        }
    }
    printf("%d",ans);
    return 0;
}