#include<fstream>
#include<vector>
#include<queue>
#define inf 214748364
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n, m, nod, i, vecin, cost, d[50003];
vector <pair <int, int> > l[250003];
priority_queue< pair<int, int>, vector<pair<int, int> > > heap;
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        int x, y, c;
        f>>x>>y>>c;
        l[x].push_back(make_pair(y, c));
    }
    for(i=2;i<=n;i++)
        d[i]=inf;
    heap.push(make_pair(0, 1));
    while(!heap.empty())
    {
        nod=heap.top().second;
        heap.pop();
        for(vector< pair<int, int> > :: iterator it=l[nod].begin(); it!=l[nod].end(); it++)
        {
            vecin=it->first;
            cost=it->second;
            if(d[vecin]>cost+d[nod])
            {
                d[vecin]=cost+d[nod];
                heap.push(make_pair(d[vecin], vecin));
            }
        }
    }
    for(i=2;i<=n;i++)
        if(d[i]!=inf)
            g<<d[i]<<" ";
        else g<<"0 ";
    return 0;
}