#include <bits/stdc++.h>

struct edge
{
    int v, cost;
};

int nodes, edges, u, v, cost;

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

int distance[50001], OO = (1 << 31) - 1;

bool visited[50001];

struct orderByDistance
{
    bool operator()(int a, int b)
    {
        return distance[a] > distance[b];
    }
};

std :: priority_queue<int, std :: vector<int>, orderByDistance> q;

void Dijkstra(int start)
{
    for(int i = 1; i <= nodes; i++)
    {
        distance[i] = OO;
    }

    distance[start] = 0;

    q.push(start);

    while(!q.empty())
    {
        int u = q.top(); q.pop();

        if(!visited[u])
        {
            visited[u] = true;

            for(edge i : adj[u])
            {
                int v = i.v, cost = i.cost;

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

                    q.push(v);
                }
            }
        }
    }
}

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

    scanf("%d %d", &nodes, &edges);

    for(int i = 1; i <= edges; i++)
    {
        scanf("%d %d %d", &u, &v, &cost);

        adj[u].push_back({v, cost});
    }

    Dijkstra(1);

    for(int i = 2; i <= nodes; i++)
    {
        printf("%d ", distance[i] == OO ? 0 : distance[i]);
    }

    return 0;
}