#include <bits/stdc++.h>
#define oo 2e9
using namespace std;

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

int n , m , viz[50005] , d[50005];
vector<pair<int , int>> L[50005];

void Dijkstra(int start)
{
    int i , k;
    for(i = 1;i <= n;i++)
    {
        viz[i] = 0;
        d[i] = oo;
    }
    d[start] = 0;
    for(int j = 1;j <= n;j++)
    {
        int mn = INT_MAX;
        k = 0;
        for(i = 1;i <= n;i++)
            if(d[i] < mn and viz[i] == 0)
            {
                mn = d[i];
                k = i;
            }
        viz[k] = 1;
        for(auto e : L[k])
            if(e.second + mn < d[e.first]) d[e.first] = mn + e.second;
    }
}

int main()
{
    int  i , j , k , c;
    fin >> n >> m;
    for(k = 1;k <= m;k++)
    {
        fin >> i >> j >> c;
        L[i].push_back({j , c});
    }
    Dijkstra(1);
    for(i = 2;i <= n;i++)
        fout << d[i] << " ";
    return 0;
}