#include <bits/stdc++.h>
using namespace std;
ifstream f ("dijkstra.in");
ofstream g ("dijkstra.out");
#define NMax 50005
#define infinit (1<<31)-1
long long n,m,i;
long long d[NMax];
bool incoada[NMax];
vector <pair<long long,long long>>G[NMax];
struct comparaDistante
{
    bool operator()(int x,int y)
    {
        return d[x]>d[y];
    }
};
priority_queue< long long ,vector<long long >,comparaDistante>Q;
void citire()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        long long x,y,c;
        f>>x>>y>>c;
        G[x].push_back(make_pair(y,c));

    }
}
void Dijkstra(long long nodstart)
{
    for(i=1;i<=n;i++)d[i]=infinit;
    d[nodstart]=0;
    Q.push(nodstart);
    incoada[nodstart]=true;
    while(!Q.empty())
    {
        int nodcurent=Q.top();
        Q.pop();
        incoada[nodcurent]=false;
        for(size_t i=0;i<G[nodcurent].size();i++)
        {
            int vecin=G[nodcurent][i].first;
            int cost=G[nodcurent][i].second;
            if(d[nodcurent]+cost<d[vecin])
            {
                d[vecin]=d[nodcurent]+cost;
                if(incoada[vecin]==false)
                {
                    Q.push(vecin);
                    incoada[vecin]=true;
                }
            }
        }
    }
}
void afisare()
{
    for(i=2;i<=n;i++)
    {
        if(d[i]!=infinit)g<<d[i]<<" ";
        else g<<0<<" ";
    }
}
int main()
{
    citire();
    Dijkstra(1);
    afisare();
    return 0;
}