#include <bits/stdc++.h>
#define MAXN 50005
#define INF 0xfffff
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
struct edge{
    int v,c;
    edge(int v=0, int c=0):v(v),c(c){}
    bool operator<(edge oth) const{
        return c<oth.c;
    }
};
int n,m,D[MAXN],viz[MAXN],t[MAXN];
vector<edge> G[MAXN];
void Dijkstra(int s)
{
    for(int i=1;i<=n;++i)
        D[i]=INF;
    priority_queue<edge> q;
    q.push(edge(s,0));
    D[s]=0;
    while(!q.empty())
    {
        edge e=q.top();
        q.pop();
        if(e.c==D[e.v])
        for(edge i : G[e.v])
        {
            if(e.c+i.c<D[i.v])
            {
                D[i.v]=e.c+i.c;
                q.push(edge(i.v,D[i.v]));
            }
        }
    }
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;++i)
    {
        int a,b,c;
        in>>a>>b>>c;
        G[a].push_back(edge(b,c));
    }
    Dijkstra(1);
    for(int i=2;i<=n;++i)
        out<<(D[i]==INF?0:D[i])<<' ';
    return 0;
}