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

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

using VI = vector<int>;
const int Inf = 0x3f3f3f3f;
const int MOD = 104659;
struct Pair{
    double dist;
    int nod;

    bool operator < ( const Pair& p ) const
    {
        return dist > p.dist;
    }
};
int N, M;
vector<vector<Pair>> G;
VI d;
VI nr;

void ReadGraph();
void Dijkstra( int nod, VI& d );
void Write();

int main()
{
    ReadGraph();
    Dijkstra(1, d);
    Write();

    fin.close();
    fout.close();
    return 0;
}

void ReadGraph()
{
    int x, y, w;

    fin >> N >> M;
    G = vector<vector<Pair>>(N + 1);
    while ( M-- )
    {
        fin >> x >> y >> w;
        G[x].push_back({w, y});
        G[y].push_back({w, x});
    }
}

void Dijkstra( int nod, VI& d )
{
    d = VI(N + 1, Inf);
    nr = VI(N + 1);
    priority_queue<Pair> Q;
    Q.push({1, nod});
    d[nod] = 1;
    nr[nod] = 1;

    while ( !Q.empty() )
    {
        int x = Q.top().nod;
        int t = Q.top().dist;

        Q.pop();
        if ( t > d[x] ) continue;
        for ( const auto& p : G[x] )
        {
            int y = p.nod;
            int w = p.dist;

            if ( d[y] > d[x] * w )
            {
                d[y] = d[x] * w;
                Q.push({d[y], y});
                nr[y] = nr[x];
            }
            else
                if ( d[y] == d[x] * w )
                    nr[y] += nr[x];
        }
    }
}

void Write()
{
    for ( int i = 2; i <= N; ++i )
        fout << nr[i] << ' ';
}