#include <iostream>

#include<bits/stdc++.h>
#include<fstream>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int INF=0x3f3f3f3f;
int dist[50005];
vector<vector<pair<int,int> > > neighbours;
struct nodeOfPq
{
    int theNode;
    int cost;
    bool operator<(nodeOfPq otherNode) const
    {
        if(cost<otherNode.cost)
            return true;
        return false;
    }
};
void dijkstra(int node)
{
    dist[node]=0;
    priority_queue <nodeOfPq> pq;
    pq.push({node,0});
    while(!pq.empty())
    {
        nodeOfPq currentOne=pq.top();
        int currentValue=currentOne.cost;
        int currentNode=currentOne.theNode;

        vector<pair<int,int> >::iterator eachOne;
        pq.pop();
        for(eachOne=neighbours[currentNode].begin(); eachOne!=neighbours[currentNode].end(); eachOne++)
        {
            int nodeVecin=(*eachOne).first;
            int nodeCost=(*eachOne).second;
            if(dist[nodeVecin]>currentValue+nodeCost)
            {
                dist[nodeVecin]=currentValue+nodeCost;
                pq.push({nodeVecin,dist[nodeVecin]});
            }
        }

    }
}
int main()
{
    int n,m;
    fin>>n>>m;
    for(int i=1; i<=n; i++)
        dist[i]=INF;
    neighbours=vector<vector<pair<int,int> > > (n+1);
    for(int i=0; i<m; i++)
    {
        int x,y,cost;
        fin>>x>>y>>cost;
        neighbours[x].push_back({y,cost});
    }

    dijkstra(1);

    for(int i=2;i<=n;i++)
		if(dist[i]!= INF)
        fout<<dist[i]<<" ";
        else
            fout<<"0 ";
    fin.close();
    fout.close();
    return 0;
}