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

int n, m, dist[DM], a, b ,c;
queue <int> q;
vector < pair<int, int> > g[DM];

void bellmanford()
{
    for(int i = 2; i <= n; i++)
        dist[i] = INF;
    q.push(1);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(auto it : g[nod])
            if(dist[nod] + it.second < dist[it.first])
            {
                dist[it.first] = dist[nod] + it.second ;
                q.push(it.first);
            }
    }
    for(int i = 2; i <= n; i++)
        if(dist[i] == INF)
            fout << 0 << ' ';
        else fout << dist[i] << ' ';
}
int main ()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> a >> b >> c;
        g[a].push_back({b, c});
    }
    bellmanford();
    return 0;
}