///the best as time
#include <fstream>
#define N 50002
#include <queue>
#include <vector>
#define INF 2000000000

using namespace std;

struct bla
{
    int ve,co;
};
vector <bla> graph[N];

struct how
{
    bool operator()(bla A, bla B)
    {
        return (A.co>B.co);
    }
};
priority_queue <bla, vector <bla>, how> q;
int dist[N];
bool viz[N];
void dijkstra(int nod)
{
    int v;
    q.push({nod,0});
    while(!q.empty())
    {
        nod=q.top().ve;
        q.pop();
        if(viz[nod]) continue;
        viz[nod]=1;
        for(int i=0;i<graph[nod].size();++i)
        {
            v=graph[nod][i].ve;
            if(dist[v]>dist[nod]+graph[nod][i].co)
            {
                dist[v]=dist[nod]+graph[nod][i].co;
                q.push({v,dist[v]});
            }
        }
    }
}
int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    int n,m,x,y,c;
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y>>c;
        graph[x].push_back({y,c});
    }
    for(int i=2;i<=n;++i) dist[i]=INF;
    dijkstra(1);
    for(int i=2;i<=n;++i)
    {
        if(dist[i]==INF) dist[i]=0;
        g<<dist[i]<<' ';
    }
    f.close();
    g.close();
    return 0;
}