#include <bits/stdc++.h>

using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int M=50005;
const int inf=(1<<30);
int n, m, x, y, p, viz[M], d[M];
vector<pair<int, int>> v[M];
struct comp{
    bool operator()(int x, int y)
    {
        return d[x]>d[y];
    }
};
priority_queue<int, vector<int>, comp> q;
void citire()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y>>p;
        v[x].push_back(make_pair(y, p));
    }
}
void dijkstra(int k)
{
    for(int i=1; i<=n; i++)d[i]=inf;
    q.push(k);
    viz[k]=1;
    d[k]=0;
    while(!q.empty())
    {
        int x=q.top();
        q.pop();
        viz[x]=0;
        for(size_t i=0; i<v[x].size(); i++)
        {
            int vcn=v[x][i].first, cst=v[x][i].second;
            if(d[x]+cst<d[vcn])
            {
                d[vcn]=d[x]+cst;
                if(!viz[vcn])
                {
                    q.push(vcn);
                    viz[vcn]=1;
                }
            }

        }
    }
}
void afis()
{
    for(int i=2; i<=n; i++)
    {
        if(d[i]!=inf)g<<d[i]<<" ";
        else g<<"0 ";
    }
}
int main()
{
    citire();
    dijkstra(1);
    afis();
    return 0;
}