#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int N=50001;
const int INF=500000000;
struct cost
{
    int vf,c;
};
vector <cost> a[N];
queue <int> q;
int n,m,d[N];
bool inq[N];
void citire()
{
    int x,y,c;
    cost aux;
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y>>c;
        aux.vf = y;
        aux.c=c;
        a[x].push_back(aux);
    }
}
bool bfs(int x)
{
    int y;
    q.push(x);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        inq[x]=false;
        for(size_t i=0;i<a[x].size();i++)
        {
            y=a[x][i].vf;
            if(d[y]>d[x]+a[x][i].c)
            {
                d[y]=d[x]+a[x][i].c;
                if(!inq[y])
                {
                    q.push(y);
                    inq[y]=true;
                }
            }
        }
    }
}
int main()
{
    for(int i=0;i<=N;i++)
        d[i]=INF;
    citire();
    d[1]=0;
    bfs(1);
    for(int i=2;i<=n;i++)
        if(d[i]!=INF)
            out<<d[i]<<' ';
        else
            out<<0<<' ';
    return 0;
}