#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("dmin.in");
ofstream g("dmin.out");
vector <pair <int,int> > v[1501];
queue <int> q;
int n,m,x,y,c,i,j;
long long d[1501],nr[1501];
int main()
{
    f>>n>>m;
    for (i=1;i<=m;i++)
    {
        f>>x>>y>>c;
       v[x].push_back(make_pair(y,c));
       v[y].push_back(make_pair(x,c));
    }
    for (i=1;i<=n;i++)
        d[i]=1ll<<61-1;
    d[1]=1;
    q.push(1);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for (j=0;j<v[x].size();j++)
            if (d[v[x][j].first]>d[x]*v[x][j].second)
            d[v[x][j].first]=d[x]*v[x][j].second,q.push(v[x][j].first);

    }
    nr[1]=1;
    q.push(1);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
         for (j=0;j<v[x].size();j++)
            {
                if (d[v[x][j].first]==d[x]*v[x][j].second)
             nr[v[x][j].first]++,q.push(v[x][j].first);
            }
    }
    for (i=2;i<=n;i++)
        g<<nr[i]<<' ';
    return 0;
}