#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define DM 50005
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m, a, b, c, viz[DM], dist[DM];
const int INF = 0x3f3f3f3f;
vector <pair<int, int> > g[DM];
priority_queue<pair<int, int> > pq;

void dijkstra()
{
    for(int i = 2; i <= n; i++)
        dist[i] = INF;
    pq.push({0, 1});
    while(!pq.empty())
    {
        int nod = pq.top().second;
        pq.pop();
        if(!viz[nod])
        {
            viz[nod] = 1;
            for(auto it : g[nod])
                if(dist[it.first] > dist[nod] + it.second)
                {
                    dist[it.first] = dist[nod] + it.second;
                    pq.push({-dist[it.first], it.first});
                }
        }
    }
}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> a >> b >> c;
        g[a].push_back({b, c});
    }

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