#include <fstream>
#include<set>
#include<list>
#include<cstring>
#include<algorithm>

using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m,a,b,c,to,cost,nod,d,dist[50003];

list<pair<int, int> >v[50003];
set<pair<int, int> >h;


const int INF=0x3f3f3f3f;

int main()
{
    int i,j;
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        f>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
    list<pair<int, int> > ::iterator it;
    memset(dist, INF, sizeof dist);
    dist[1]=0;
    h.insert(make_pair(0,1));
    while(!h.empty())
    {
        nod=h.begin()->second;
        d=h.begin()->first;
        h.erase(h.begin());
        for(it=v[nod].begin();it!=v[nod].end();++it)
        {
            to=it->first;
            cost=it->second;
            if(dist[to]>dist[nod]+cost)
            {
                if(dist[to]!=INF)
                    h.erase(h.find(make_pair(dist[to],to)));
                dist[to]=dist[nod]+cost;
                h.insert(make_pair(dist[to],to));
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(dist[i]==INF) dist[i]=0;
        g<<dist[i]<<' ';
    }
    g<<'\n';
    f.close();
    g.close();
    return 0;
}