#include <bits/stdc++.h>
#define pii pair <int,int>
#define INF 0x3f3f3f3f

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct str{
    int nod,cost;
    bool operator < (const str&other) const
    {
        return cost>other.cost;
    }
};

int n,m,drum[50005];
vector <pii> v[50005];
priority_queue <str> q;

void dijkstra()
{
    while(!q.empty())
    {
        int nod=q.top().nod;
        int cost=q.top().cost;
        q.pop();
        for(auto it=v[nod].begin();it<v[nod].end();it++)
        {
            int nxt=(*it).first;
            int cst=(*it).second;
            if(drum[nxt]>drum[nod]+cst)
            {
                drum[nxt]=drum[nod]+cst;
                q.push({nxt,drum[nxt]});
            }
        }
    }
}

int main()
{
    fin>>n>>m;

    memset(drum,INF,sizeof(drum));

    for(int i=1;i<=n;i++)
    {
        int x,y,z;
        fin>>x>>y>>z;
        v[x].push_back({y,z});
    }

    drum[1]=0;
    q.push({1,0});
    dijkstra();
    for(int i=2;i<=n;i++)
    {
        if(drum[i]==INF)
            fout<<0<<" ";
        else
            fout<<drum[i]<<" ";
    }

    return 0;
}