#include <bits/stdc++.h>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n,m,i,x,y,c;
int d[50005],viz[50005];
int inf=INT_MAX;

struct muchie
{
    int x,c;
};

struct comp
{
    bool operator()(int x,int y)
    {
        return d[x]>d[y];
    }
};

vector<muchie> G[50005];
priority_queue<int,vector<int>,comp>pq;

void dijkstra(int S)
{
    d[S]=0;
    pq.push(S);
    viz[S]=1;

    while(!pq.empty())
    {
        int nod = pq.top();
        pq.pop();
        viz[nod]=0;

        for(auto& it : G[nod])
        {
            int nodc = it.x;
            int cost = it.c;

            if(d[nod] + cost < d[nodc])
            {
                d[nodc] = d[nod] + cost;
                if(viz[nodc]==0)
                {
                    pq.push(nodc);
                    viz[nodc]=1;
                }
            }
        }
    }
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        G[x].push_back({y,c});
    }
    for(i=1;i<=n;i++)
    {
        d[i]=inf;
    }

    dijkstra(1);

    for(i=2;i<=n;i++)
    {
        if(d[i]!=inf)
        {
            fout<<d[i]<<" ";
        }
        else
        {
            fout<<"0";
        }
    }
    fin.close();
    fout.close();
    return 0;
}