#include <vector>
#include <fstream>
#include <queue>
#include <climits>

using namespace std;

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

vector<pair<int,int> > adj[50002];
int dist[50002];
bool visited[50002];

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

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++) {
        dist[i]=INT_MAX;
    }
    dijkstra(1);
    for(int i=2;i<=n;i++)
        if(dist[i]==INT_MAX)
            fout<<0<<" ";
        else
            fout<<dist[i]<<" ";
    return 0;
}