#include <bits/stdc++.h>
#define ll long long

using namespace std;
ifstream fin("dmin.in");
ofstream fout("dmin.out");
ll n,m,viz[1505],k[1505];
double d[1505];
const double e=1e-9;
vector<pair<ll,double>>v[1505];
priority_queue<pair<double,ll>>q;
double dabs(double x)
{
	return x > 0 ? x : -x;
}
void citire()
{
    ll x,y;
    double cost;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        cost=log(cost);
        v[x].push_back({y,cost});
        v[y].push_back({x,cost});
    }
    for(int i=1;i<=n;i++)
        d[i]=INT_MAX;
}
void dijkstra(int start)
{
    for(int i=1;i<=n;i++)
        viz[i]=0;
    d[start]=1;
    k[1]=1;
    q.push({0,start});
    while(!q.empty())
    {
        ll x=q.top().second;
        q.pop();
        //fout<<d[x]<<" ";
        for(auto i:v[x])
        {
            if(d[i.first]-(d[x]+i.second)>e)
            {
                d[i.first]=d[x]+i.second;
                k[i.first]=1;
                q.push({-d[i.first],i.first});
            }
            else if(dabs(d[i.first]-d[x]-i.second)<e){
                k[i.first]=(k[i.first]+1)%104659;
                    q.push({-d[i.first],i.first});
            }
        }
    }
}
void afisare()
{
    for(int i=2;i<=n;i++)
        fout<<k[i]<<" ";
}
int main()
{
    citire();
    dijkstra(1);
    afisare();
    return 0;
}