#include <bits/stdc++.h>
#define Nmax 50005
#define inf 1<<30

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int d[Nmax];



vector < pair<int,int> > mat[Nmax];
queue <int> coada;
int n,m,a,b,c;

void dijkstra(int nodstrat)
{
    for(int i=1;i<=n;i++)
        d[i]=inf;
    d[nodstrat]=0;
    coada.push(nodstrat);
    while(!coada.empty())
    {
        int nod=coada.front();
        coada.pop();
        for(int i=0;i<mat[nod].size();i++)
        {
            int next=mat[nod][i].first;
            int cost=mat[nod][i].second;
            if(d[nod]+cost<d[next])
            {
                d[next]=d[nod]+cost;
                coada.push(next);
            }
        }
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        mat[a].push_back({b,c});
    }
    dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(d[i]!=inf)
            fout<<d[i]<<" ";
        else
            fout<<"0 ";
    }
    return 0;
}