#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <vector>

///PRACTICE

using namespace std;

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

const int NMAX=5e4+5;
const int INF=2e9;

vector<pair<int,int>>v[NMAX];
int dist[NMAX];
bool viz[NMAX];

priority_queue<pair<int,int>>pq;

void dijkstra()
{
    while(!pq.empty())
    {
        int p=pq.top().second;
        pq.pop();
        viz[p]=false;
        for(auto i:v[p])
        {
            if(dist[p]+i.second<dist[i.first])
            {
                dist[i.first]=dist[p]+i.second;
                if(!viz[i.first])
                    viz[i.first]=true,pq.push(make_pair(-dist[i.first],i.first));
            }
        }
    }
}
int main()
{
    int n,m,i,j,x,y,c;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    for(i=1;i<=n;i++)
        dist[i]=INF;
    dist[1]=0;
    viz[1]=true;
    pq.push(make_pair(0,1));
    dijkstra();
    for(i=2;i<=n;i++)
        if(dist[i]==INF)
            fout<<0<<" ";
        else
            fout<<dist[i]<<" ";
    return 0;
}