#include <iostream>
#include <bits/stdc++.h>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

const int N=1e9;

vector<pair<int,int>>v[50001];
priority_queue <pair<int,int>> pq;
bool viz[50001];
int d[50001],n,m,x,urm,cost;

int main()
{
    int a,b,c;
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>a>>b>>c;
        v[a].push_back({b,c});
    }
    for(int 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(int i=0;i<v[x].size();i++)
            {
                urm=v[x][i].first;
                cost=v[x][i].second;
                if(d[x]+cost<d[urm])
                {
                    d[urm]=d[x]+cost;
                    pq.push({-d[urm],urm});
                }
            }
            viz[x]=1;
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]!=N)
            g<<d[i]<<' ';
        else
            g<<"0 ";
    }
    return 0;
}