#include <fstream>
#include <queue>
#include <vector>
#define INF 100000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct muchie{
    int nod, cost;
};

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

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

int main()
{
    int n, m, i, x, y, cost;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        l[x].push_back({y, cost});
    }
    pq.push({1, 0});
    dp[1]=0;
    for(i=2;i<=n;i++)
    {
        dp[i]=INF;
    }
    while(!pq.empty())
    {
        int nod=pq.top().nod;
        int cost=pq.top().cost;
        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 costvecin=l[nod][i].cost;
            if(dp[vecin]>dp[nod]+costvecin)
            {
                dp[vecin]=dp[nod]+costvecin;
                pq.push({vecin, dp[vecin]});
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(dp[i]==INF)
        {
            fout<<0<<" ";
            continue;
        }
        fout<<dp[i]<<" ";
    }
}