#include <bits/stdc++.h>
#define INF 1000000000
#define N 50010
using namespace std;

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

vector<pair<int,int>>v[N];
priority_queue<pair<int,int>>q;
pair<int,int>p;
int n,m,viz[N],d[N],a,b,c;

int main()
{
    fin>>n>>m;
    for(;m;m--)
    {
        fin>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
    for(int i=2;i<=n;i++)d[i]=INF;
    q.push(make_pair(0,1));
    while(q.size())
    {
        p=q.top();
        q.pop();
        c=-p.first;
        a=p.second;
        if(viz[a])continue;
        viz[a]=1;
        for(auto it:v[a])
        {
            if(c+it.second<d[it.first])
            {
                d[it.first]=c+it.second;
                q.push(make_pair(-d[it.first],it.first));
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==INF)fout<<0<<' ';
        else fout<<d[i]<<' ';
    }
    return 0;
}