#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define inf 2000000000
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
vector <pair<int,int> >v[50010];
int n,m,a,b,c,d[50010];
pair<int,int> tt;
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >pq;
int main()
{
    fin>>n>>m;
    for(;m;m--)
    {
        fin>>a>>b>>c;
        v[a].push_back(make_pair(c,b));
    }
    for(int i=2;i<=n;i++)
        d[i]=inf;
    for(auto it:v[1])
    {
        d[it.second]=it.first;
        pq.push(make_pair(it.first,it.second));
    }
    while(!pq.empty())
    {
        tt=pq.top();
        pq.pop();
        if(tt.first==d[tt.second])
        {
            for(auto it:v[tt.second])
            {
                if(d[tt.second]+it.first<d[it.second])
                {
                    d[it.second]=d[tt.second]+it.first;
                    pq.push(make_pair(d[it.second],it.second));
                }
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==inf) fout<<"0 ";
        else  fout<<d[i]<<" ";
    }

    return 0;
}