#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair<long long,int>> v[50003];
int d[50004],n,m,viz[50004];
#define INF 0x3f3f3f3f
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        long long cost;
        fin>>x>>y>>cost;
        v[x].push_back(make_pair(cost,y));
    }
    for(int i=2;i<=n;i++) d[i]=INF;
    d[1]=0;
    priority_queue<pair<long long,int>> heap;
    heap.push({0,1});
    while(!heap.empty())
    {
        int u=heap.top().second;
        int u1=d[u];
        heap.pop();
        if(viz[u]==0)
        {
            viz[u]=1;
            for(int i=0;i<v[u].size();i++)
            {
                if(d[v[u][i].second]>u1+v[u][i].first)
                {
                    d[v[u][i].second]=u1+v[u][i].first;
                    heap.push({-d[v[u][i].second],v[u][i].second});
                }
            }
        }
    }
    for(int i=2;i<=n;i++)
        if(d[i]>=INF) fout<<0<<' ';
        else fout<<d[i]<<' ';
    return 0;
}