#include<bits/stdc++.h>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int N=1e9;
vector<pair<int,int>>v[50001];
priority_queue <pair<int,int>> pq;
bool viz[50001];
int d[50001];
int main()
{
    int n,m,x,i,urm,cs,a,b,c;
    in>>n>>m;
    for(i=1;i<=m;i++)
    {
        in>>a>>b>>c;
        v[a].push_back({b,c});
    }
    for(i=2;i<=n;i++)
        d[i]=N;
    d[1]=0;
    pq.push({0,1});
    while(!pq.empty())
    {
        x=pq.top().second;
        pq.pop();
        if(viz[x]==0)
        {
            for(i=0;i<v[x].size();i++)
            {
                urm=v[x][i].first;
                cs=v[x][i].second;
                if(d[x]+cs<d[urm])
                {
                    d[urm]=d[x]+cs;
                    pq.push({-d[urm],urm});
                }
            }
            viz[x]=1;
        }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]!=N)
            out<<d[i]<<' ';
        else
            out<<"0 ";
    }
    return 0;
}