#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define lim 100005

using namespace std;

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

int dist[lim], n, m, parcurs[lim];
const int oo=1000000000;
struct comp_dist
{
    bool operator()(int x, int y)
    {
        return dist[x]>dist[y];
    }
};

vector <pair<int, int> > v[lim];
priority_queue <int, vector <int>, comp_dist> q;

void citire()
{
    in>>n>>m;
    int x, y, c;
    for(int i=1; i<=m; ++i)
    {
        in>>x>>y>>c;
        v[x].push_back(make_pair(y, c));
    }
}

void afisare()
{
    for(int i=2; i<=n; ++i)
    {
        if(dist[i]==oo)
        {
            out<<0<<" ";
        }
        else
        {
            out<<dist[i]<<" ";
        }
    }
}

void dijkstra()
{
    int x;
    for(int i=2; i<=n; ++i)
    {
        dist[i]=oo;
    }
    dist[1]=0;
    q.push(1);
    while(!q.empty())
    {
        x=q.top();
        for(int i=0; i<v[x].size(); ++i)
        {
            if(/*parcurs[v[x][i].first]==0 &&*/ dist[v[x][i].first]>dist[x]+v[x][i].second)
            {
                dist[v[x][i].first]=dist[x]+v[x][i].second;
                q.push(v[x][i].first);
                parcurs[v[x][i].first]=1;
            }
        }
        q.pop();
        parcurs[x]=0;
    }
}

int main()
{
    citire();
    dijkstra();
    afisare();
    return 0;
}