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

using namespace std;

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

const int SIZE = 50005;
const int INF = 0x3f3f3f3f;

int n, m;

vector < pair <int, int> > adj[SIZE];
vector <int> dist(SIZE, INF);
vector <bool> inQueue(SIZE, false);

struct Compare
{
    inline bool operator() (int x, int y)
    {
        return dist[x] > dist[y];
    }
};

void Read()
{
    f >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y, z;
        f >> x >> y >> z;
        adj[x].push_back(make_pair(y, z));
    }
}

void Dijkstra(int start)
{
    priority_queue <int, vector <int>, Compare> pq;

    dist[start] = 0;
    pq.push(start);
    inQueue[start] = true;

    while (pq.empty() == false)
    {
        int node = pq.top();
        pq.pop();
        inQueue[node] = false;

        for (unsigned int i = 0; i < adj[node].size(); i++)
        {
            int neighbour = adj[node][i].first;
            int cost = adj[node][i].second;

            if (dist[node] + cost < dist[neighbour])
            {
                dist[neighbour] = dist[node] + cost;

                if (inQueue[neighbour] == false)
                {
                    pq.push(neighbour);
                    inQueue[neighbour] = true;
                }
            }
        }
    }
}

void Print()
{
    for (int i = 2; i <= n; i++)
    {
        if (dist[i] == INF)
        {
            g << "0 ";
        }
        else
        {
            g << dist[i] << " ";
        }
    }
}

int main()
{
    Read();
    Dijkstra(1);
    Print();

    return 0;
}