#include<bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct elem
{
    int destinatie,cost;
    bool operator<(const elem other)const
    {
        return cost>other.cost;
    }
};

vector<elem>v[50005];

priority_queue<elem>pq;

int dist[50005],n,m,x,y,z;


void dijkstra(int nod)
{
    int i;
    pq.push({1,0});
    while(!pq.empty())
    {
        int node=pq.top().destinatie;
        int cost=pq.top().cost;
        pq.pop();
        for(i=0;i<v[node].size();i++)
        if(dist[v[node][i].destinatie]>cost+v[node][i].cost)
        {
            dist[v[node][i].destinatie]=cost+v[node][i].cost;
            pq.push({v[node][i].destinatie,v[node][i].cost+cost});
        }
    }
    for(i=2;i<=n;i++)
        {
            if(dist[i]==INT_MAX)
                fout<<0<<" ";
            else
            fout<<dist[i]<<" ";
        }
}
int main()
{
    int i;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>z;
        v[x].push_back({y,z});
    }
    for(i=1;i<=n;i++)
        dist[i]=INT_MAX;
    dijkstra(1);
    return 0;
}