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

using namespace std;

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

#define MAX 250005
#define inf 1<<30

vector < pair < int , int > > :: iterator it;
vector < pair < int , int > > v[MAX];
priority_queue < pair < int , int > > pq;
int dist[MAX],n,m;

void dij()
{
    for(int i=2;i<=n;i++)
        dist[i]=inf;
    pq.push(make_pair(0,1));
    while(!pq.empty())
    {
        int nod=pq.top().second;
        pq.pop();
        for(it=v[nod].begin();it!=v[nod].end();it++)
        {
            int anod=it->first;
            int c=it->second;
            if(dist[anod] > dist[nod] + c)
            {
                dist[anod] = dist[nod] + c;
                pq.push(make_pair(-dist[anod],anod));
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(dist[i] < inf)
            fout<<dist[i]<<" ";
        else
            fout<<0<<" ";
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        fin>>x>>y>>z;
        v[x].push_back(make_pair(y,z));
    }
    dij();
    fin.close();
    fout.close();
    return 0;
}