#include <iostream>
#include <fstream>
#include <climits>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n,m;
vector <pair <int,int> > G[50005];
priority_queue <pair <int,int> > Q;///retinem si nodul si drumul minim actualizat
int dp[50005],ok[50005];
void citire()
{
    fin>>n>>m;
    for(int i=1; i<=m ; i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        G[x].push_back({y,c});
    }
    for(int i=2; i<=n; i++)
    dp[i]=INT_MAX/2;
}
void dijkstra()
{
    Q.push({dp[1],1});
    ok[1]=1;
    while(!Q.empty())
    {
        int x=Q.top().second;
        Q.pop();
        ok[x]=0;
        for(auto &v: G[x])
        {
            int y=v.first;
            int c=v.second;
            if(dp[y]>dp[x]+c)
            {
                dp[y]=dp[x]+c;
                if(!ok[y])
                {
                    ok[y]=1;
                    Q.push({dp[y],y});
                }

            }
        }
    }
}
int main()
{
    citire();
    dijkstra();
    for(int i=2; i<=n; i++)
        if(dp[i]!=INT_MAX/2) fout<<dp[i]<<" ";
        else fout<<"0 ";
    return 0;
}