#include <bits/stdc++.h>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int dist[50001];

vector< pair <int, int> > v[50001];

priority_queue< pair <int, int> > heap;

int n, m, x, y, z;

void dijkstra(int node)
{
    int fiu, cost, c, nod;
    heap.push({0, node});
    while(heap.size())
    {
        nod=heap.top().second;
        c=-heap.top().first;
        heap.pop();
        if(c<=dist[nod])
        {
            for(int i=0; i<v[nod].size(); i++)
            {
                fiu=v[nod][i].first;
                cost=v[nod][i].second;
                if(dist[nod]+cost<dist[fiu])
                {
                    heap.push({-(dist[nod]+cost),fiu});
                    dist[fiu]=dist[nod]+cost;
                }
            }
        }
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>z;
        v[x].push_back({y, z});
    }
    for(int i=2; i<=n; i++)
        dist[i]=1000000001;
    dijkstra(1);
    for(int i=2; i<=n; i++)
    {
        if(dist[i]==1000000001)
            fout<<"0 ";
        else
            fout<<dist[i]<<" ";
    }
    return 0;
}