#include <bits/stdc++.h>
using namespace std;

#define INF 1000000000

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

int n, m;
int d[50001];
vector<pair<int,int>> v[50001];

priority_queue< pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;

void Dijkstra(int start)
{
    for(int i=1;i<=n;i++)
        d[i]=INF;

    d[start]=0;
    q.push({0,start});

    while(!q.empty())
    {
        auto [dist,nod]=q.top();
        q.pop();

        if(dist != d[nod]) 
            continue;

        for(auto &e:v[nod])
        {
            int vecin=e.first;
            int cost=e.second;

            if(dist+cost<d[vecin])
            {
                d[vecin]=dist+cost;
                q.push({d[vecin],vecin});
            }
        }
    }
}

int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {   int x,y,z;
        f>>x>>y>>z;
        v[x].push_back({y, z});
    }
    Dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(d[i]==INF) 
            g<<0<<" ";
        else 
            g<<d[i]<< " ";
    }
    
    return 0;
}