#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
#define NM 50005
using namespace std;

vector < pair < int, int > > graf[NM];
queue < int > Q;

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

int n, m, cost[NM];

int main()
{
    int x, y, c, nod2, nod;
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y >> c;
        graf[x].push_back(make_pair(y, c));
    }
    for(int i = 2; i <= n; ++i)
        cost[i] = INF;
    Q.push(1);
    cost[1] = 0;
    while( !Q.empty() )
    {
        nod = Q.front();
        Q.pop();
        for(int i = 0; i < graf[nod].size(); ++i)
        {
            nod2 = graf[nod][i].first;
            if(cost[nod2] > cost[nod] + graf[nod][i].second)
            {
                cost[nod2] = cost[nod] + graf[nod][i].second;
                Q.push(nod2);
            }
        }
    }
    for(int i = 1; i <= n; ++i)
    {
        if(cost[i] == INF) cost[i] = 0;
        g << cost[i] << ' ';
    }
}