#include<bits/stdc++.h>
#define int long long
#define INF 1000000000000000000
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m;

struct elem
{
    int x,cost;
    bool operator < (const elem &a) const
    {
        return cost>a.cost;
    }
};
vector<elem>v[50005];
priority_queue<elem>pq;
int ans[50005];

signed main()
{
    int i,x,y,c,nr,nod,z,l;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for(i=1;i<=n;i++)
        ans[i]=INF;
    pq.push({1,0});
    ans[1]=0;
    while(!pq.empty())
    {
        nod=pq.top().x;
        c=pq.top().cost;
        pq.pop();
        if(c==ans[nod])
        {
            for(auto it:v[nod])
            {
                if(ans[it.x]>ans[nod]+it.cost)
                {
                    ans[it.x]=ans[nod]+it.cost;
                    pq.push({it.x,ans[nod]+it.cost});
                }
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(ans[i]==INF)
            g<<0;
        else
            g<<ans[i];
        g<<" ";
    }
    return 0;
}