#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define inf 1000000007
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
vector <pair<int,int> >v[50010];
int n,m,d[50010],a,b,c;
priority_queue <pair<int,int> ,vector<pair<int,int> >,greater<pair<int,int> > >pq;
pair<int,int>tt;
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;

    pq.push(make_pair(0,1));
    while(!pq.empty())
    {
        tt=pq.top();
        pq.pop();
        if(tt.first==d[tt.second])
        {
            for(int j=0;j<v[tt.second].size();j++)
            {
                if(tt.first+v[tt.second][j].first<d[v[tt.second][j].second])
                {
                    d[v[tt.second][j].second]=tt.first+v[tt.second][j].first;
                    pq.push(make_pair(d[v[tt.second][j].second],v[tt.second][j].second));
                }
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==inf)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    }


    return 0;
}