#include <bits/stdc++.h>

#define NMax 50005

using namespace std;

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

int N,M;
vector<pair<int,int> > Graph[NMax];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > Queue;
int Dist[NMax];
const int INF=1<<30;

void Dijkstra(int source)
{
    for(int i=1;i<=N;i++)
        Dist[i]=INF;
    Dist[source]=0;
    Queue.push(make_pair(Dist[source],source));
    while(!Queue.empty())
    {
        int node=Queue.top().second;
        int d=Queue.top().first;
        Queue.pop();
        if(Dist[node]!=d)
            continue;
        for(vector<pair<int,int> >::iterator it=Graph[node].begin();it!=Graph[node].end();it++)
        {
            int to=it->first;
            int cost=it->second;
            if(Dist[to]>Dist[node]+cost)
            {
                Dist[to]=Dist[node]+cost;
                Queue.push(make_pair(Dist[to],to));
            }
        }
    }
}

int main()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int x,y,z;
        fin>>x>>y>>z;
        Graph[x].push_back(make_pair(y,z));
    }
    Dijkstra(1);
    for(int i=2;i<=N;i++)
        if(Dist[i]>=INF)
            fout<<"0 ";
        else
            fout<<Dist[i]<<" ";

    return 0;
}