#include <bits/stdc++.h>
#define Dim 50004
#define oo 1e9
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
long a,b,c,N,M,D[Dim];
bool viz[Dim];

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

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

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

void Dijkstra()
{
    minheap.push(1);
    viz[1]=1;
    D[1]=0;
    while(!minheap.empty())
    {
        int nod=minheap.top();
        minheap.pop();
        for(unsigned int i=0;i<V[nod].size();i++)
        {
            long vecin=V[nod][i].first;
            long cost=V[nod][i].second;
            if(D[nod]+cost<D[vecin]) 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>>a>>b>>c;
        V[a].push_back({b,c});
        D[i]=oo;
    }
    Dijkstra();
    for(int i=2;i<=N;i++)
       if(D[i]==oo) g<<0<<" ";
       else g<<D[i]<<" ";
    return 0;
}