#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
vector <pair<int,int> > a[250010];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> Q;
int n,m,d[50010];
bool v[50010];
int main()
{
    f>>n>>m;
    for(int i=2; i<=n; i++)
        d[i]=999999;
    for(int i=1; i<=m; i++)
    {   int x,y,c;
        f>>x>>y>>c;
        a[x].push_back(make_pair(c,y));
    }
    Q.push(make_pair(0,1));
    while(!Q.empty())
    {   int nod=Q.top().second,dist=Q.top().first;
        v[nod]=1;
        Q.pop();
        if(dist>d[nod]) continue;
        for(auto pr:a[nod])
        {   int vec = pr.second;
            int cost_m = pr.first;
            if(d[vec]>d[nod]+cost_m)
            {   d[vec]=d[nod]+cost_m;
                Q.push(make_pair(d[vec],vec));
            }
        }
    }
    for(int i=2;i<=n;i++)
        if(v[i])g<<d[i]<<' ';
        else g<<'0'<<' ';
    return 0;
}