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

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

vector<pair<int,int> > adj[100002];
int visited[100002];

void dijkstra(int s)
{
    priority_queue<pair<int,int> > pq;
    pq.push({0,s});
    visited[s]=0;
    while(!pq.empty())
    {
        auto v=pq.top().second;
        pq.pop();
        for(auto u:adj[v])
        {
            //cout<<v<<" ";
            if(visited[u.second]==INT_MAX)
            {
                pq.push(u);
            }
            visited[u.second]=min(visited[u.second],visited[v]+u.first);
        }

    }
}

int main()
{
    int n,m;
    fin>>n>>m;
    for (int i = 0; i < m; i++)
    {
        int v1,v2,w;
        fin>>v1>>v2>>w;
        adj[v1].push_back({w,v2});
    }
    for (int i = 0; i <= n; i++) {
        visited[i]=INT_MAX;
    }
    dijkstra(1);
    for(int i=2;i<=n;i++)
        if(visited[i]==INT_MAX)
            fout<<0<<" ";
        else
            fout<<visited[i]<<" ";
    return 0;
}