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

constexpr int INF=(1<<30);

vector <int> dist (NMAX, INF);
vector<pair<int,int>> a[NMAX];

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

void dijkstra(int start)
{
    priority_queue <pair<int,int>> q;
    q.push({-0,start});
    dist[start]=0;
    while(!q.empty())
    {
        int cost = q.top().first, nod = q.top().second;
        q.pop();
        cost=-cost;
        if(cost > dist[nod])
            continue;
        for(auto p : a[nod])
        {
            int c = p.first, vecin = p.second;
            if(dist[vecin] > dist[nod]+c)
            {
                dist[vecin]= dist[nod]+c;
                q.push({dist[vecin], vecin});
            }
        }
    }


}

int main()
{
    int n,m,s,l;
    fin>>n>>m;
    for(int u,v,c,i=1; i<=m; i++)
    {
        fin>>u>>v>>c;
        a[u].push_back({c,v});
        ///a[v].push_back({c,u});
    }
    dijkstra(1);

    for(int i=2;i<=n;i++)
    if(dist[i]!=INF)
        fout<<dist[i]<<' ';
    else
        fout<<"0 ";

    return 0;
}