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

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

struct ceva
{
    int node,cost;

    bool operator <(const ceva &x)const
    {
        return cost > x.cost;//pt ca priority queue are topul si botul inversat
    }
};

vector<vector<ceva>>g;

int dist[50001],n,m;
bool viz[50001];

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

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


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

        if(viz[top.node])
            continue;

        viz[top.node]=1;

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

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

    return 0;
}