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

using namespace std;

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

const int nmax=50005;
const int infinit= (1 << 30);
int n, m, d[nmax];
bool incoada[nmax];

vector < pair < int, int > > g[nmax];
struct compara
{
    bool operator()(int x, int y)
    {
        return d[x]>d[y];
    }
};

priority_queue < int, vector < int >, compara> coada;

void citire()
{
    in>>n>>m;
    int x, y, c;
    while(in>>x>>y>>c)
        g[x].push_back(make_pair(y,c));
}

void dijkstra(int nodstart)
{
    for(int i=1;i<=n;i++)
        d[i]=infinit;
    d[nodstart]=0;
    coada.push(nodstart);
    incoada[nodstart]=true;
    while(!coada.empty())
    {
        int nodcurent=coada.top();
        coada.pop();
        incoada[nodcurent]=false;
        for(size_t i=0;i<g[nodcurent].size();i++)
        {
            int vecin=g[nodcurent][i].first;
            int cost=g[nodcurent][i].second;
            if(d[nodcurent]+cost<d[vecin])
            {
                d[vecin]=d[nodcurent]+cost;
                if(!incoada[vecin])
                {
                    coada.push(vecin);
                    incoada[vecin]=true;
                }
            }
        }
    }
}

void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(d[i]!=infinit)
            out<<d[i]<<' ';
        else
            out<<"-1 ";
    }
}

int main()
{
    citire();
    dijkstra(1);
    afisare();
}