#include<bits/stdc++.h>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m,i,x,y,c,d[50001];
vector<int> G[50001],C[50001];
queue<int>q;
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        G[x].push_back(y);
        C[x].push_back(c);
    }
    q.push(1);
    for(i=2;i<=n;i++)
        d[i]=INT_MAX;
    while(!q.empty())
    {
        x=q.front();
        for(i=0;i<G[x].size();i++)
        {
            if(d[G[x][i]]>d[x]+C[x][i])
            {
                d[G[x][i]]=d[x]+C[x][i];
                q.push(G[x][i]);
            }
        }
          q.pop();
    }
    for(i=2;i<=n;i++)
    if(d[i]==INT_MAX)
    g<<0<<" ";
    else
    g<<d[i]<<" ";
    return 0;
}