#include <iostream>
#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int d[50005],n,m;
const int INF=1000000005;
struct cmp
{
    bool operator() (const int &a,const int &b)
    {
        return d[a]<d[b];
    }
};
multiset <int,cmp> H;
vector < pair<int,int> >a[50005];
int main()
{
    int x,y,cost,i;
    f>>n>>m;
    while(m--)
    {
        f>>x>>y>>cost;
        a[x].push_back({y,cost});
    }
    for(i=1;i<=n;i++)
    {
        d[i]=INF;
    }
    d[1]=0;
    H.insert(1);
    while(!H.empty())
    {
        x=*H.begin();
        H.erase(H.begin());
        for(i=0;i<a[x].size();i++)
        {
            if(d[a[x][i].first]>d[x]+a[x][i].second)
            {
                d[a[x][i].first]=d[x]+a[x][i].second;
                H.insert(a[x][i].first);
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]==INF)
            g<<0<<" ";
        else
            g<<d[i]<<" ";
    }
    return 0;
}