#include <fstream>
#include <vector>
using namespace std;
ifstream in ("dijkstra.in");
ofstream out ("dijkstra.out");
const int inf = 0x3FFFFFFF;
int n, m,x,viz[50001], d[50001];
vector <pair<int,int> > A[50001];
int main()
{   in>>n>>m;
    for(int x,y,c,i=1;i<=m;i++)
    {   in>>x>>y>>c;
        A[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=n;i++) d[i]=1<<30;
    for (unsigned int j = 0; j < A[x].size(); j++)   d[j] = a[x][j];
    viz[x] = 1; d[0] = inf;
    for (int k = 1; k <= n; k++)
    {
        int min_c = 0;
        for (int i = 1; i <= n; i++)
            if (!viz[i] and d[i] < d[min_c])
                min_c = i;
        viz[min_c] = 1;
        for (int i = 1; i <= n; i++)
            if (!viz[i] and d[i] > d[min_c] + a[min_c][i])
                     d[i] = d[min_c] + a[min_c][i];
    }
    for (int i = 1; i <= n; i++)
        if (d[i] == inf) out << -1 << " ";  else out << c[i] << " ";
    out.close(); return 0;
}