#include <bits/stdc++.h>
#define Dim 50001
#define Max 1e9+1
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int N,M,x,y,z,D[Dim],viz[Dim];

vector < pair<int,int> > V[Dim];

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

priority_queue < int,vector< int >,cmp > minheap;


void Dijkstra()
{
    D[1]=0;
    viz[1]=1;
   // for(int i=1;i<=N;i++)
    minheap.push(1);

    while(!minheap.empty())
    {
        int nod=minheap.top();
        minheap.pop();

        for(unsigned int i=0;i<V[nod].size();i++)
        {
            int vecin=V[nod][i].first;
            int cost=V[nod][i].second;
            //Relaxare
            if( D[vecin] > D[nod] + cost )
            {
                D[vecin]=D[nod]+cost;
                if( !viz[ vecin ]  )
                {
                    viz[vecin]=1;
                    minheap.push(vecin);
                }
            }
        }
    }
}

int main()
{

    f>>N>>M;
    for(int i=1;i<=M;i++)
    {
        f>>x>>y>>z;
        V[x].push_back({y,z});
    }
    for(int i=1;i<=N;i++) D[i]=Max;
    Dijkstra();

    for(int i=2;i<=N;i++)
    if( D[i] == Max ) g<<0<<" ";
    else
    g<<D[i]<<" ";

    return 0;
}