#include <bits/stdc++.h>
#define mp make_pair
#define pii pair <int,int>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m,d[1<<16],ok[1<<16];

vector <pii> v[1<<16];
vector <pii> :: iterator it;
set <pii> heap;

int main()
{   f>>n>>m;
    for(int x,y,c; f>>x>>y>>c; v[x].push_back(mp(y,c)));
    for(int i=2; i<=n; i++)
        d[i]=(1<<30);
    heap.insert(mp(0,1));
    d[1]=0;
    while(!heap.empty())
    {   int nod=(*heap.begin()).second;
        heap.erase(heap.begin());
        for(it=v[nod].begin(); it!=v[nod].end(); it++)
        {   int nodV=(*it).first,cost=(*it).second;
            if(d[nod]+cost<d[nodV])
            {   if(d[nodV]!=(1<<30))
                    heap.erase(heap.find(mp(d[nodV],nodV)));
                heap.insert(mp(cost+d[nod],nodV));
                d[nodV]=cost+d[nod];
            }
        }
    }
    for(int i=2; i<=n; i++)
        g<<(d[i]==(1<<30) ? 0 : d[i])<<' ';
    return 0;
}