// DIJKSTRA
#include<iostream>
#include<fstream>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<limits>

#define pb push_back
#define mk make_pair
#define DMAX 50004
using namespace std;

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

vector<vector<pair<int,int> > > L(DMAX);
multiset<pair<int,int> > H;
int  D[DMAX];

const int INF=numeric_limits<int>::max();
int n;

void Dijkstra(int start);

int main()
{
    int m,first;
    first=1;
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int p,d,c;
        f>>p>>d>>c;
        L[p].pb(mk(d,c));
    }
    for(int i=1;i<=n;i++)
        D[i]=INF;
    Dijkstra(first);
    for(int i=2;i<=n;i++)
        if(D[i]==INF) g<<0<<" ";
        else g<<D[i]<<" ";
    return 0;

}
void Dijkstra(int start)
{
    D[start]=0;
    H.insert(mk(0,1));
    while(!H.empty())
    {
        int nodc=H.begin()->second;
        H.erase(H.begin());
        for(vector<pair<int,int> >::iterator it=L[nodc].begin();it!=L[nodc].end();it++)
        {
            if(D[it->first]>D[nodc]+it->second)
            {
                if(D[it->first]!=INF)
                {
                    H.erase(H.find(mk(D[it->first],it->first)));
                }
                D[it->first]=D[nodc]+it->second;
                H.insert(mk(D[nodc]+it->second,it->first));
            }
        }
    }
}