#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

vector<vector<pair<int,int>>>g;

int dist[50001],n,m;

int main()
{
    cin>>n>>m;
    g.resize(n+1,vector<pair<int,int>>());
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        cin>>x>>y>>c;
        g[x].push_back(make_pair(c,y));
    }

    /*for(i=1;i<=n;i++)
        sort(g[i].begin(),g[i].end());
    */

    for(int i=1;i<=n;i++)
        dist[i] = 1e9;


    priority_queue<pair<int,int>>q;
    q.push(make_pair(0,1));
    dist[1] = 0;
    while(!q.empty())
    {
        pair<int,int>top = q.top();
        q.pop();

        for(auto nodes:g[top.second]){
            if(dist[nodes.second] > dist[top.second] + nodes.first)
                {
                    dist[nodes.second] = dist[top.second] + nodes.first;
                    q.push(make_pair(dist[nodes.second],nodes.second));
                }
        }
    }

    for(int i=2;i<=n;i++)
        cout<<dist[i]<<" ";

    return 0;
}