#include <fstream>
#include <queue>
#include <vector>
#include <climits>
#define dim 50001
#define mch 250001
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct punct{
    int nod, cost;
};

struct cmp{
    bool operator () (punct a, punct b)
    {
        return a.cost>b.cost;
    }
};

struct muchie{
    int nod, cost;
};

vector <muchie> l[dim];
int viz[dim], dp[dim];
priority_queue <punct, vector <punct>, cmp> pq;

int main()
{
    int n, m, i, x, y, c;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        l[x].push_back({y, c});
    }
    dp[1]=0;
    for(i=2;i<=n;i++)
    {
        dp[i]=INT_MAX;
    }
    pq.push({1, 0});
    while(!pq.empty())
    {
        int nod=pq.top().nod;
        pq.pop();
        if(viz[nod]==1)
        {
            continue;
        }
        viz[nod]=1;
        for(int i=0;i<l[nod].size();i++)
        {
            int vecin=l[nod][i].nod;
            int cost=l[nod][i].cost;
            if(dp[vecin]>dp[nod]+cost)
            {
                dp[vecin]=dp[nod]+cost;
                pq.push({vecin, dp[vecin]});
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(dp[i]==INT_MAX)
        {
            fout<<0<<" ";
        }
        else
        {
            fout<<dp[i]<<" ";
        }
    }
}