#include <fstream>
#include <vector>
#include <queue>
#define f first
#define s second
#define inf 2000000000
#define nmax 50004
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m,x,y,c,dist[nmax];
bool seen[nmax];
vector <pair<int,int> > G[nmax];
priority_queue <pair<int,int> > q;

int main()
{
    f>>n>>m;
    for (int i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        G[x].push_back({y,c});
    }

    for (int i=2;i<=n;i++) dist[i]=inf;

    q.push({0,1});
    while (!q.empty())
    {
        int node=q.top().s;
        q.pop();
        if (seen[node]) continue;
        seen[node]=1;
        for (auto ne:G[node])
            if (dist[node]+ne.s<dist[ne.f])
            {
                dist[ne.f]=dist[node]+ne.s;
                q.push({-dist[ne.f],ne.f});
            }
    }

    for (int i=2;i<=n;i++)
        if (dist[i]==inf) g<<0<<' ';
        else g<<dist[i]<<' ';

    f.close();
    g.close();
    return 0;
}