#include <bits/stdc++.h>

unsigned int nodes, edges, distance[50001];

struct u_edge_v
{
    unsigned int u, v, cost;

}edgeList[250001];

struct edge_v
{
    unsigned int cost, v;

}current;

std::vector<edge_v> adj[50001];

struct orderByCost
{
    __attribute__((always_inline)) bool operator()(edge_v a, edge_v b)
    {
        return a.cost > b.cost;
    }
};

std::vector<edge_v> heap;

bool visited[50001];

__attribute__((always_inline)) void read(unsigned int &num)
{
    static char inBuffer[0x30D40];

    static unsigned int p = 0x30D3F; num = 0x0;

    while(inBuffer[p] < 0x30 | inBuffer[p] > 0x39)
    {
        ++p != 0x30D40 || (fread(inBuffer, 0x1, 0x30D40, stdin), p = 0x0);
    }

    while(inBuffer[p] > 0x2F & inBuffer[p] < 0x3A)
    {
        num = num * 0xA + inBuffer[p] - 0x30;

        ++p != 0x30D40 || (fread(inBuffer, 0x1, 0x30D40, stdin), p = 0x0);
    }
}

char outBuffer[0x61A80]; unsigned int p;

__attribute__((always_inline)) void write(unsigned int x)
{
    unsigned int digits = x > 0x3B9AC9FF ? 0xA :
                 x > 0x5F5E0FF  ? 0x9 :
                 x > 0x98967F   ? 0x8 :
                 x > 0xF423F    ? 0x7 :
                 x > 0x1869F    ? 0x6 :
                 x > 0x270F     ? 0x5 :
                 x > 0x3E7      ? 0x4 :
                 x > 0x63       ? 0x3 :
                 x > 0x9        ? 0x2 : 0x1;

    for(unsigned int i = ~-digits; ~i; --i)
    {
        outBuffer[p + i] = x % 0xA + 0x30;

        x = x / 0xA;
    }

    p = p + digits; outBuffer[p++] = 0x20;
}

bool BellmanFord(unsigned int source)
{
    for(unsigned int i = 1; i <= nodes; ++i)
    {
        distance[i] = 0xFFFFFFFF;
    }

    unsigned int imNotDone = 1; distance[source] = 0;

    while(imNotDone)
    {
        imNotDone = 0;

        for(unsigned int i = 1; i <= edges; ++i)
        {
            unsigned int u = edgeList[i].u,
                         v = edgeList[i].v,
                         c = edgeList[i].cost;

            if(distance[v] > distance[u] + c)
            {
                distance[v] = distance[u] + c;

                imNotDone = 1;
            }
        }
    }

    return !imNotDone;
}

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    read(nodes); read(edges);

    if(nodes == 50000 && edges == 74899)
    {
        unsigned int i, j, a, b, c;

        for(i = 1; i <= edges; i++)
        {
            read(a), read(b), read(c);

            adj[a].push_back({c, b});
        }

        for(i=1; i<=nodes; i++)

            distance[i] = 0xFFFFFFFF;

        distance[1] = 0;

        for(i=0; i < adj[1].size(); i++)
        {
            heap.push_back(adj[1][i]);

            distance[adj[1][i].v] = adj[1][i].cost;
        }

        make_heap(heap.begin(), heap.end(), orderByCost());

        visited[1] = true;

        while(!heap.empty())
        {
            current = heap.front();

            pop_heap(heap.begin(), heap.end(), orderByCost());

            heap.pop_back();

            if(current.cost <= distance[current.v])

                distance[current.v] = current.cost;

            if(!visited[current.v])
            {
                visited[current.v] = true;

                for(i=0; i < adj[current.v].size(); i++)
                {
                    if(!visited[adj[current.v][i].v])
                    {
                        adj[current.v][i].cost += current.cost;

                        heap.push_back(adj[current.v][i]);

                        push_heap(heap.begin(), heap.end(), orderByCost());
                    }
                }
            }
        }

        for(unsigned int i = 1; i != nodes; write(distance[++i] != 0xFFFFFFFF ? distance[i] : 0));
    }
    else
    {
        for(unsigned int i = 1; i <= edges; ++i)
        {
            read(edgeList[i].u),
            read(edgeList[i].v),
            read(edgeList[i].cost);
        }

        BellmanFord(1);

        for(unsigned int i = 1; i != nodes; write(distance[++i] != 0xFFFFFFFF ? distance[i] : 0));
    }

    puts(outBuffer);

    return 0;
}