#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50005
#define infint (1<<31)-100
using namespace std;

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

int n, m, a, b, c;
vector<pair<int, int>> ad[NMAX]; ///{indice, cost}
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q; ///{cost, indice}
int d[NMAX], viz[NMAX];

void dijkstra (int start_node)
{
    for(int i=1; i<=n; i++)
        d[i]=infint;
    d[start_node]=0;
    q.push({0, start_node});
    while(!q.empty())
    {
        int nod=q.top().second;
        q.pop();
        if(!viz[nod])
        {
            viz[nod]=1;
            for(auto &vecin: ad[nod])
            {
                if(d[nod]+vecin.second<d[vecin.first])
                {
                    d[vecin.first]=d[nod]+vecin.second;
                    q.push({d[vecin.first], vecin.first});
                }
            }
        }
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>a>>b>>c;
        ad[a].push_back({b, c});
    }
    dijkstra(1);
    for(int i=2; i<=n; i++)
        if(d[i]==infint)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    return 0;
}