#include <fstream>
#include <queue>
#include <vector>
#include <cstring>

using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
vector< pair<int,int> > a[50001];
priority_queue < pair <int,int>, vector < pair<int,int> >,greater < pair<int,int> > > h;
int dist[50001],n;
bool viz[50001];
void dijkstra()
{
    int i;
    for(i=1;i<=n;i++)
        dist[i]=9999999;
    dist[1]=0;
    h.push({0,1});

    while(!h.empty())
    {
        int nod = h.top().second;
        h.pop();
        if(!viz[nod])
        {
         for(i=0;i<a[nod].size();i++)
         {
             int to=a[nod][i].second;
             int cost=a[nod][i].first;
             if(dist[to]>dist[nod]+cost)
             {
                 dist[to]=dist[nod]+cost;
                 h.push(make_pair(dist[to],to));
             }
         }
        }
        viz[nod]=true;
    }
}
int m,i,x,y,c;
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        a[x].push_back(make_pair(c,y));
    }
    dijkstra();
    for(i=2;i<=n;i++)
    {
        if(dist[i]==9999999)g<<0<<" ";
        else g<<dist[i]<<" ";
    }
    return 0;
}