#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define MAX_N 50001
using namespace std;

vector< pair<int,int> > v[MAX_N];
queue<int> coada;
int viz[MAX_N];
int dist[MAX_N];
int main()
{
    int n,m,i,a,b,c;
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    f>>n>>m;
    for(i=0;i<m;i++){
        f>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }

    coada.push(1);
    viz[1]=1;

    for(i=1;i<=n;i++)
        dist[i]=-1;

    //cout<<v[1][0];

    while(!coada.empty()){
        int nod=coada.front();
        for(i=0;i<v[nod].size();i++){
            //cout<<"comparatie:"<<dist[v[nod][i].first]<<"si"<<dist[nod]+v[nod][i].second<<" ";
            if(viz[v[nod][i].first]==0 || dist[v[nod][i].first]>dist[nod]+v[nod][i].second){
                coada.push(v[nod][i].first);
                viz[v[nod][i].first]=1;
                int act=dist[nod];
                    if(act==-1)
                        act=0;

                if(dist[v[nod][i].first]==-1 || dist[v[nod][i].first]>v[nod][i].second+act){
                    if(dist[v[nod][i].first]==-1)
                        dist[v[nod][i].first]=0;

                    dist[v[nod][i].first]+=act+v[nod][i].second; //v[nod][i].second;
                    if(dist[nod]==-1)
                            dist[nod]=0;
                    if(dist[v[nod][i].first]>v[nod][i].second+dist[nod]){
                        dist[v[nod][i].first]=v[nod][i].second+dist[nod];
                        //cout<<v[nod][i].first<<"cu"<<v[nod][i].second+dist[nod]<<" ";
                    }
                }
                //cout<<v[nod][i].first<<"are"<<dist[v[nod][i].first]<<'\n';
            }
        }
        coada.pop();
    }

    for(i=2;i<=n;i++)
        g<<dist[i]<<" ";
    //cout<<v[1][1].second;
    return 0;
}