#include <bits/stdc++.h>
using namespace std;
const int N=50000;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
priority_queue <pair<int,int>> coada;
vector<pair<int,int>> v[N+1];
bool incoada[N+1];
int drum[N+1];
int main()
{
    int n,m,y,x,i,c;
    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for(i=2; i<=n; i++)
        drum[i]=INT_MAX;
    coada.push({0,1});
    while(!coada.empty())
    {
        x=coada.top().second;
        incoada[x]=false;
        coada.pop();
        for(i=0; i<v[x].size();i++)
        {
            if(drum[v[x][i].first]>drum[x]+v[x][i].second)
            {
                drum[v[x][i].first]=drum[x]+v[x][i].second;
                if(incoada[v[x][i].first]==false)
                {
                    incoada[v[x][i].first]=true;
                    coada.push({drum[v[x][i].first],v[x][i].first});
                }
            }
        }
    }
    for(i=2;i<=n;i++)
        if(drum[i]==INT_MAX)
        out<<"0 ";
        else
        out<<drum[i]<<" ";
    return 0;
}