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

using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int lim = 50000;
const int INF = 1e9;

vector<pair<int, int>> lista[lim+5]; //first->nod, second->cost
int viz[lim+5], dist[lim+5];
int n, m;

void Dijkstra(int sursa)
{
    for(int i=1; i<=n; i++)
        dist[i] = INF;
    dist[sursa] = 0;
    priority_queue<pair<int, int>> pq; //first->-dist[nod], second->nod
    pq.push({0, sursa});
    while(!pq.empty())
    {
        int nod = pq.top().second;
        pq.pop();
        if(viz[nod]==0)
        {
            viz[nod] = 1;
            for(size_t i = 0; i < lista[nod].size(); i++)
            {
                int vecin = lista[nod][i].first;
                int cost = lista[nod][i].second;
                if(dist[nod] + cost < dist[vecin])
                {
                    dist[vecin] = dist[nod] + cost;
                    pq.push({-dist[vecin], vecin});
                }
            }
        }
    }
}

int main()
{
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x, y, c;
        in>>x>>y>>c;
        lista[x].push_back(make_pair(y, c));
    }

    Dijkstra(1);

    for(int i=2; i<=n; i++)
    {
        if(dist[i] == INF) out<<"0 ";
        else out<<dist[i]<<' ';
    }
    return 0;
}