#include <bits/stdc++.h>

using namespace std;

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

int n, m;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>heap;
vector<pair<int, int>>G[50001];
int D[50001];
bool viz[50001];

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        int x, y, c;
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y, c));
    }
    heap.push(make_pair(1, 0));
    for(int i=2; i<=n; ++i)
    {
        D[i]=INT_MAX;
    }
    while(!heap.empty())
    {
        int nod=heap.top().first;
        heap.pop();
        if(viz[nod]) continue;
        for(auto it:G[nod])
        {
            if(D[it.first]>D[nod]+(it.second))
            {
                D[it.first]=D[nod]+(it.second);
                heap.push(make_pair(it.first, it.second));
            }
        }
        viz[nod]=1;
    }
    for(int i=2; i<=n; ++i)
    {
        if(D[i]!=INT_MAX) fout<<D[i]<<" ";
        else fout<<"0 ";
    }
    return 0;
}