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

using namespace std;

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

int n, m, dist[lim], incoada[lim];

vector <pair<int, int> > v[lim];



struct compara
{
    bool operator()( int x,  int y)
    {
        return dist[x] > dist[y];
    }
};

priority_queue <int, vector<int>, compara> q;

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

}

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

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

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