#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

struct Edge{
    int nod;
    int cost;
};

int main() {
    int noduri, muchii, ind = 0;
    in >> noduri >> muchii;

    vector < int > d(noduri, ind);
    vector < int > viz(noduri, 0);
    vector < vector < Edge > > G(noduri+1);
	
	for (int i = 1; i <= muchii; ++i) {
		int a, b, cost;
		in >> a >> b >> cost;
		Edge edge;
		edge.nod = b;
		edge.cost = cost;
		
		G[b].push_back(edge);
	}
	
	for(int i = 1; i<= noduri; i++)
	{

		int minim = ind;
		
		for(int k = 0; k < noduri; k++)
			if(d[k] < minim && viz[k] == 0)
			{
				minim = d[k];
				ind = k;
			}
	}
    for(auto edge:G[ind])
        if(d[edge.nod] > d[ind] + edge.cost)
        {
        	d[edge.nod] = d[ind] + edge.cost;
        	out << d[edge.nod] << "\t";
        }
    
    return 0;
}