#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

#define NMax 1505
#define oo (1 << 30)

ifstream fin("dmin.in");
ofstream fout("dmin.out");

vector < pair <int, int> > g[NMax];
int D[NMax], n, m, drumuri[NMax], add;
bool inCoada[NMax];
struct compara{
    bool operator()(int x, int y)
    {
        return D[x] > D[y];
    }
};
priority_queue <int, vector < int >, compara> q;

void Read()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        g[x].push_back(make_pair(y, c));
        g[y].push_back(make_pair(x, c));
    }
}
void Dijkstra(int start)
{
    for(int i = 1; i <= n; i++)
        D[i] = oo;
    D[start] = 1;
    q.push(start);
    drumuri[start] = 1;
    inCoada[start] = 1;
    while(!q.empty())
    {
        int nod = q.top();
        q.pop();
        inCoada[nod] = 0;
        for(int i = 0; i < g[nod].size(); i++)
        {
            int vecin = g[nod][i].first;
            int cost = g[nod][i].second;
            if(D[nod] * cost < D[vecin])
            {
                drumuri[vecin] = drumuri[nod];
                D[vecin] = D[nod] * cost;
                if(!inCoada[vecin])
                {
                    q.push(vecin);
                    inCoada[vecin] = 1;
                }
            }
            else if(D[nod] * cost == D[vecin])
            {
                drumuri[vecin] += drumuri[nod];
                if(!inCoada[vecin])
                {
                    q.push(vecin);
                    inCoada[vecin] = 1;
                }
            }
        }
    }
}
int main()
{
    Read();
    Dijkstra(1);
    for(int i = 2; i <= n; i++)
        fout << drumuri[i] << " ";
}