#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
#include <map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#define MAX 500000000000
//#include <iostream>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
void di(int n, vector<int> cost[], vector<int> dijk[], unsigned long long vec[])
{
    vec[0] = 0;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < dijk[i].size(); j++)
                vec[dijk[i][j]] = min(vec[i] + cost[i][j], vec[dijk[i][j]]);
}
int main()
{
    vector<int> dijk[50004];
    vector<int> cost[50004];
    int n, m, a, b, c;
    unsigned long long vecval[50004];
    for(int i = 0; i < 50004; i++)
        vecval[i] = MAX;
    cin >> n >> m;
    for(int i = 0; i < m; i++){
        cin >> a >> b >> c;
        dijk[a - 1].push_back(b - 1);
        cost[a - 1].push_back(c);
    }
    di(n, cost, dijk, vecval);
    for(int i = 1 ; i < n; i++)
        cout << (vecval[i] ==  MAX ? 0 : vecval[i]) << " ";
    return 0;
}