#include <fstream>
#include <vector>
#include <queue>
#define nmax 50004
#define inf 100000000
#define f first
#define s second
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m,a,b,c,dist[nmax],fr[nmax];
vector <pair<int,int> > G[nmax];
priority_queue <pair<int,int> > pq;
int main()
{
    f>>n>>m;
    for (int i=1;i<=m;i++)
    {
        f>>a>>b>>c;
        G[a].push_back({b,-c});
    }
    dist[1]=0;
    for (int i=2;i<=n;i++) dist[i]=inf;
    pq.push({0,1});
    while (!pq.empty())
    {
        int node=pq.top().s,d=pq.top().f;
        pq.pop();
        if (fr[node]) continue;
        fr[node]=1;
        for (auto ne:G[node])
            if (dist[node]-ne.s<dist[ne.f])
            {
                dist[ne.f]=dist[node]-ne.s;
                pq.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;
}