#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <string.h>

#define NMax 50005
#define INF 999999

using namespace std;

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

int N,M;
int Dist[NMax];
vector<pair<int,int> > Graf[NMax];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > Queue;

void Read()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int from,to,cost;
        fin>>from>>to>>cost;
        Graf[from].push_back(make_pair(to,cost));
    }
}

void Dijkstra(int source)
{
    memset(Dist,INF,sizeof(Dist));
    Dist[source]=0;
    Queue.push(make_pair(0,source));
    while(!Queue.empty())
    {
        int nod=Queue.top().second;
        int d=Queue.top().first;
        Queue.pop();
        if(Dist[nod]!=d)
            continue;
        for(size_t i=0;i<Graf[nod].size();i++)
        {
            int to=Graf[nod][i].first;
            int cost=Graf[nod][i].second;
            if(Dist[to]>Dist[nod]+cost)
            {
                Dist[to]=Dist[nod]+cost;
                Queue.push(make_pair(Dist[to],to));
            }
        }
    }
}

void Write()
{
    for(int i=2;i<=N;i++)
        if(Dist[i]>INF)
            fout<<"0 ";
        else fout<<Dist[i]<<" ";
}

int main()
{
    Read();
    Dijkstra(1);
    Write();
    return 0;
}