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

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int viz[50005], dist[50005];
int n, m, a, b, c;
#define INF 1000000007

vector <pair <int, int> > graph[50005];
priority_queue <int, vector<int> >myQueue;
pair <int, int> best;
void Dijkstra (int s)
{
    for(int i=2; i<=n; i++)
        dist[i] = INF;

    dist[s] = 0;
    myQueue.push(s);
    viz[s] = 1;

    while(!myQueue.empty())
    {
        int nodCurent = myQueue.top(); //nodul
        myQueue.pop();

        viz[nodCurent] = 0;
        int dim = graph[nodCurent].size();
        for(int i=0; i<dim; i++) //parcurg vecinii
        {
            int vecin = graph[nodCurent][i].first;
            int cost = graph[nodCurent][i].second;
            if(dist[nodCurent] + cost < dist[vecin])
                {
                    dist[vecin] = dist[nodCurent] + cost;
                    if(viz[vecin] == 0)
                    {
                        myQueue.push(vecin);
                        viz[vecin] = 1;
                    }
                }
        }
    }
}
int main()
{
    //citire
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        f>>a>>b>>c;
        graph[a].push_back(make_pair(b, c));
    }

    Dijkstra(1);
    for(int i=2; i<=n; i++)
    {
        if(dist[i] == INF)
            g<<0<<" ";
        else
            g<<dist[i]<<" ";
    }
}
//dupa apm cu prim