#include <fstream>
#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, i, j, y, z, dist[500005], x1, c;
struct nod
{
    int nod, cost;
} x;
vector <nod> v[500005];
bool viz[500005];
struct comp
{
    bool operator()(const nod &a, const nod &b)
    {
        return a.cost>b.cost;
    }
};
priority_queue <nod, vector <nod>, comp> q;
int main()
{
    fin>>n>>m;
    for(i=2; i<=n; i++)
        dist[i]=1e9;
    for(i=1; i<=m; i++)
    {
        fin>>x1>>y>>c;
        v[x1].push_back({y, c});
    }
    q.push({1, 0});
    while(!q.empty())
    {
        x=q.top();
        q.pop();
        if(!viz[x.nod])
            for(auto i: v[x.nod])
                if(dist[i.nod]>dist[x.nod]+i.cost)
                {
                    dist[i.nod]=dist[x.nod]+i.cost;
                    q.push({i.nod, dist[i.nod]});
                }
        viz[x.nod]=1;
    }
    for(i=2; i<=n; i++)
        if(dist[i]==1e9)
            fout<<0<<" ";
        else
            fout<<dist[i]<<" ";
    return 0;
}