#include <bits/stdc++.h>

using namespace std;
vector<pair<int,int>>v[50005];
priority_queue<pair<int,int>>pq;
int dist[50005];
int main()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    int n,m,x,y,z;
    cin>>n>>m;
    for(int i=0; i<m; i++)
    {
        cin>>x>>y>>z;
        v[x].push_back({y,z});
    }
    for(int i=2;i<=n;i++)
        dist[i]=1000005;
    pq.push({0, 1});
    while(pq.size()>0)
    {
        pair<int,int>a=pq.top();
        int distcur=-a.first,nodcur=a.second;
        pq.pop();
        for(auto x : v[nodcur])
        {
           //x.first-nod
           //x.second-dist
           if(distcur+x.second<dist[x.first])
           {
               dist[x.first]=distcur+x.second;
               pq.push({-dist[x.first],x.first});
           }
        }
    }
    for(int i=2;i<=n;i++)
        cout<<dist[i]%1000005<<" ";
    return 0;
}