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

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

const int NMax = 50005;
const int oo = (1 << 30);

vector < pair <int,int> >G[NMax];

int N, M;
int D[NMax];
bool inCoada[NMax];
queue <int>Coada;
void citire()
{
    fin>>N>>M;
    for(int i=1;i<=M;++i)
    {
        int x,y,c;
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
}

void Dijkstra(int s)
{
    for(int i=1;i<=N;++i)
        D[i]=oo;
    D[s]=0;
    Coada.push(s);
    inCoada[s]=true;
    while(!Coada.empty())
    {
        s=Coada.front();
        inCoada[s]=false;
        Coada.pop();
        int l=G[s].size();
        for(size_t i=0;i<l;++i)
        {
            int v=G[s][i].first;
            int cost=G[s][i].second;
            if(D[s]+cost<D[v])
            {
                D[v]=D[s]+cost;
                if(inCoada[v]==false)
                {
                    inCoada[v]=true;
                    Coada.push(v);
                }
            }
        }
    }
}

void afisare()
{
    for(int i=2;i<=N;++i)
        if(D[i]!=oo)fout<<D[i]<<" ";
        else fout<<"0 ";
}

int main()
{
    citire();
    fin.close();
    Dijkstra(1);
    afisare();
    fout.close();
    return 0;
}