#include <fstream>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int NMAX=50000;
const int INF=1000000000;
vector <pair<int,int> >G[NMAX+5];
priority_queue<pair<int,int> >q;
int n;
int dist[NMAX+5];
void Dijkstra()
{
   int nod, i, d;
    for(i=2;i<=n;i++)
        dist[i]=INF;
    dist[1]=0;
    q.push(make_pair(0, 1));
    while(!q.empty())
    {
        d=-q.top().first;
        nod=q.top().second;
        q.pop();
        if(dist[nod]<d)
            continue;
        else
        {

        for(i=0;i<G[nod].size();i++)
        {
            int u=G[nod][i].first;
            int cost=G[nod][i].second;
            if(dist[u]>cost+d)
                {
                    dist[u]=cost+d;
                   q.push(make_pair(-dist[u], u));
                }

        }
      }//else

    }

}

int main()
{
    int m, i, x, y, c;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y, c));
    }
    Dijkstra();
    for(i=2;i<=n;i++)
    {
        if(dist[i]==INF)
            fout<<"-1"<<" ";
        else
            fout<<dist[i]<<" ";
    }
    return 0;
}