#include <bits/stdc++.h>

using namespace std;

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

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

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