#include <bits/stdc++.h>

using namespace std;
int dist[50005];
bool viz[50005];
vector<pair<int,int>>v[50005];
priority_queue<pair<int,int>>pq;
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]=10000000;
    pq.push({0,1});
    while(pq.size()>0)
    {
        pair<int,int>tmp=pq.top();
        int nodcur=tmp.second, val=-tmp.first;
        pq.pop();
        if(viz[nodcur]==0)
        {
            viz[nodcur]=1;
            for(auto var: v[nodcur])
            {
                if(dist[var.first]>val+var.second)
                {
                    dist[var.first]=val+var.second;
                     pq.push({-dist[var.first],var.first});
                }
            }
        }

    }
    for(int i=2;i<=n;i++)
        cout<<dist[i]%10000000<<" ";
    return 0;
}