#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
struct muchie
{
    int nod,cost;
};
struct cmp
{
    int operator()(const muchie &a,const muchie &b)
    {
        return a.cost>b.cost;
    }
};
int n,m,d[50005],viz[50005];
vector<pair<int,int>>l[50005];
priority_queue<muchie,vector<muchie>,cmp>q;
int main()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y,c;
        cin>>x>>y>>c;
        l[x].push_back({y,c});
    }
    for(int i=1; i<=n; i++)
        d[i]=2e9;
    q.push({1,0});
    d[1]=0;
    while(!q.empty())
    {
        int nod=q.top().nod;
        int cost=q.top().cost;
        q.pop();
        if(viz[nod])
            continue;
        viz[nod]=1;
        for(int i=0; i<l[nod].size(); i++)
        {
            int vecin=l[nod][i].first;
            int costnou=l[nod][i].second;
            if(d[vecin]>cost+costnou && viz[vecin]==0)
            {
                d[vecin]=cost+costnou;
                if(viz[vecin]==0)
                    q.push({vecin,d[vecin]});
            }
        }
    }
    for(int i=2; i<=n; i++)
        if(d[i]==2e9)
            cout<<0<<" ";
        else
            cout<<d[i]<<" ";
    return 0;
}