#include <cstdio>
#include <vector>
#define N 50002
#define INF 2000000000
#include <deque>

using namespace std;
FILE* f, * g;

struct bla
{
    int ve, co;
};
vector <bla> graph[N];
int d[N];
deque <int> q;
void bf(int nod)
{
    q.push_back(nod);
    d[nod] = 0;
    while (!q.empty())
    {
        nod = q.front();
        q.pop_front();
        for (int i = 0;i < graph[nod].size();++i)
            if (d[graph[nod][i].ve] > d[nod] + graph[nod][i].co)
            {
                d[graph[nod][i].ve] = d[nod] + graph[nod][i].co;
                q.push_back(graph[nod][i].ve);
            }
    }
}
int main()
{
    f = fopen("dijkstra.in", "r");
    g = fopen("dijkstra.out", "w");
    int n, m, x, y, z;
    fscanf(f, "%d %d", &n, &m);
    for (int i = 1;i <= m;++i)
    {
        fscanf(f, "%d %d %d", &x, &y, &z);
        graph[x].push_back({ y,z });
    }
    for (int i = 1;i <= n;++i)
        d[i] = INF;
    bf(1);
    for (int i = 2;i <= n;++i)
        if (d[i] == INF)
            fprintf(g, "0 ");
        else
            fprintf(g, "%d ", d[i]);
    fclose(f);
    fclose(g);
    return 0;
}