#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
vector< pair<int,int> > g[50001];int n,m;
int d[50001];
class comparVf
{
public:
    bool operator() (const int& x,const int& y)
    {
        return d[x]>d[y];
    }
};
priority_queue<int, vector<int>,comparVf> c;
int main()
{
    FILE *f;
    FILE *gg;
    f=fopen("dijkstra.in","r");
    gg=fopen("dijkstra.out","w");
    fscanf(f,"%d %d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        fscanf(f,"%d %d %d",&x,&y,&c);
        //f>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }
    for(int i=1;i<=n;i++)
        d[i]=INT_MAX;
    d[1]=0;
    c.push(1);
    while(!c.empty())
    {
        int var=c.top();
        c.pop();
        vector< pair<int,int> >::iterator it;
        for(it=g[var].begin();it!=g[var].end();++it)
            if(d[it->first]>d[var]+it->second)
        {
            d[it->first]=d[var]+it->second;
            c.push(it->first);
        }
    }
        for(int i=2;i<=n;i++)
            if(d[i]<INT_MAX) fprintf(gg,"%d ",d[i]);//gg<<d[i]<<" ";
        else fprintf(gg,"%d ",0);//gg<<0<<" ";
    return 0;
}