#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int dist[250001];
vector < pair<int,int> > M[250001];
priority_queue< pair<int, int>, vector <pair<int, int> > , greater<pair<int, int> > > Q;


int main()
{
    int n,m,x,y,i,j,c,nod,v;
    fin>>n>>m;
    for(i=1;i<=n;i++) dist[i]=300000;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        M[x].push_back(make_pair(c,y));
    }
    Q.push(make_pair(0,1));
    dist[1]=0;
    while(!Q.empty())
    {
        nod=Q.top().second;
        Q.pop();
        for(i=0;i<M[nod].size();i++)
        {
            v=M[nod][i].second;
            c=M[nod][i].first;
            if(dist[nod]+c<dist[v])
            {
                dist[v]=dist[nod]+c;
                Q.push(make_pair(dist[v],v));
            }
        }
    }
    for(i=2;i<=n;i++)
        if(dist[i]==300000)
            fout<<0<<" ";
        else
            fout<<dist[i]<<" ";
    return 0;
}