#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define INF 0x3f3f3f3f
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int N,M,d[50001];
vector < pair<int,int> > a[50001];
struct comp
{
    bool operator() (const int &X,const int &Y)
    {
        return (d[X]>d[Y]);
    }
};
priority_queue<int ,vector <int>, comp> H;
inline void Dijkstra(int sursa)
{
    int i,varf;
    for(i=1;i<=N;i++)
    {
        d[i]=INF;
    }
    d[sursa]=0;
    H.push(sursa);
    while(!H.empty())
    {
        varf=H.top();
        H.pop();
        for(i=0;i<a[varf].size();i++)
        {
            if(d[a[varf][i].first]>d[varf]+a[varf][i].second)
            {
                d[a[varf][i].first]=d[varf]+a[varf][i].second;
                H.push(a[varf][i].first);
            }
        }
    }
}
int main()
{
    int i,x,y,c;
    f>>N>>M;
    while(M--)
    {
        f>>x>>y>>c;
        a[x].push_back(make_pair(y,c));
    }
    Dijkstra(1);
    for(i=2;i<=N;i++)
    {
        if(d[i]==INF)
        {
            g<<0<<" ";
        }
        else
        {
            g<<d[i]<<" ";
        }
    }
    return 0;
}