#include <fstream>
#include <queue>
#include <climits>
#include <vector>
#define DIM 50001

using namespace std;

ifstream fin ("dijkstra.in");
ofstream fout("dijkstra.out");

int n,m,x,y,cost;
struct muchie{
    int v,c;
};
struct cmp{
    bool operator()(muchie &a, muchie &b)
    {
        return a.c>b.c;
    }
};
vector<muchie>L[DIM];
int d[DIM];
bool viz[DIM];
priority_queue<muchie,vector<muchie>,cmp>heap;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        L[x].push_back({y,cost});
    }
    heap.push({1,0});
    for(int i=2;i<=n;i++)
        d[i]=INT_MAX;
    while(!heap.empty())
    {
        int nod=heap.top().v;
        heap.pop();
        if(viz[nod]==1)
            continue;
        viz[nod]=1;
        for(auto vec: L[nod])
        {
            int v=vec.v, cost=vec.c;
            if(d[v]>d[nod]+cost)
            {
                d[v]=d[nod]+cost;
                heap.push({v,d[v]});
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==INT_MAX)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}