#include <bits/stdc++.h>

using namespace std;

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

const int NMAX=5e5,INF=1e9+7;
int n,m;
vector<vector<pair<int,int>>>adj(NMAX+5); ///cost nod
vector<int> dist(NMAX+5,INF); /// nod cost

void dijkstra(int source)
{
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int,int>>>q;
    dist[source]=0;
    q.push({dist[source],source});
    while(q.size())
    {
        int d=q.top().first;
        int nod=q.top().second;
        q.pop();
        if(dist[nod]>d) continue;
        for(auto x:adj[nod])
        {
            if(dist[x.first]>d+x.second)
            {
                dist[x.first]=d+x.second;
                q.push({dist[x.first], x.first});
            }
        }
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c; fin>>x>>y>>c;
        adj[x].push_back({y,c});
    }
    dijkstra(1);
    for(int i=1;i<=n;i++)
        if(dist[i]==INF)
        dist[i]=0;
    for(int i=2;i<=n;i++)
        fout<<dist[i]<<' ';
    return 0;
}