#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct ceva
{
    int node;
    int cost;
    bool operator < (const ceva &x) const
    {
        return cost>x.cost;
    }
};

vector<ceva>v[50005];
priority_queue<ceva>pq;
int d[50005],viz[50005];
int c,n,m,x,y;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        v[x].push_back({y , c});
    }
    for(int i=2;i<=n;i++)
    d[i]=1e9;
    pq.push({1,0});
    while(!pq.empty())
    {
        ceva p=pq.top();
        pq.pop();
        if(viz[p.node])continue;
        viz[p.node]=1;
        for(auto vecin:v[p.node])
        {
            if(d[vecin.node]>d[p.node]+vecin.cost)
            {
                d[vecin.node]=d[p.node]+vecin.cost;
                pq.push({vecin.node , d[vecin.node]});
            }
        }
    }

    for(int i=2;i<=n;i++)
        if(d[i]==1e9)fout<<"0 ";
        else fout<<d[i]<<' ';
    return 0;
}