#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

#define Nmax 50005
#define oo (1<<30)
int D[Nmax];
int N,M;
bool incoada[Nmax];

struct cmp
{
    bool operator()(int x, int y)
    {
        return D[x]>D[y];
    }
};

vector <pair <int, int> > V[Nmax];
priority_queue<int, vector <int>, cmp> Q;


void read()
{
    f>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int x,y,c;
        f>>x>>y>>c;
        V[x].push_back(make_pair(y,c));
        //V[y].push_back(make_pair(x,c));
    }
}

void Dijkstra(int nodStart)
{
    for(int i=1;i<=N;i++)
        D[i]=oo;
    D[nodStart]=0;
    incoada[nodStart]=true;
    Q.push(nodStart);
    while(!Q.empty())
    {
        int nodCurent =Q.top();
        incoada[nodCurent]=false;
        Q.pop();
        for(size_t i=0;i<V[nodCurent].size();i++)
        {
            int Vecin =V[nodCurent][i].first;
            int Cost =V[nodCurent][i].second;
            if(D[nodCurent]+Cost<D[Vecin])
            {
                D[Vecin]=D[nodCurent]+Cost;
                if(incoada[Vecin]==false)
                {
                    incoada[Vecin]=true;
                    Q.push(Vecin);
                }
            }
        }
    }
}

int main()
{
    read();
    Dijkstra(1);
    for(int i=2;i<=N;i++)
    if(D[i]!=oo)
        g<<D[i]<<" ";
    else
        g<<0<<" ";
    return 0;
}