#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#define nmax 50005
#define inf 0x3f3f3f3f
#define cost first
#define vecin second

using namespace std;

int n,m,d[nmax],visited;
vector<pair<int,int> > g[nmax];
priority_queue <pair<int,int> > q;

void citire()
{
    int a,b,c;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b>>c;
        g[a].push_back(make_pair(c,b));
    }
    memset(d,inf,sizeof(d));
}

void dijkstra()
{
    int k;
    d[1]=0;
    q.push(make_pair(0,1));
    visited = 1;
    while(visited<=n)
    {
        k=q.top().vecin;
        q.pop();
        visited++;
        for(vector<pair<int,int> >::iterator ii=g[k].begin();ii!=g[k].end();++ii)
        {
            if(d[ii->vecin]>d[k]+ii->cost)
            {
                d[ii->vecin]=d[k]+ii->cost;
                q.push(make_pair(-d[ii->vecin],ii->vecin));
            }
        }
    }
}

void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(d[i]>=inf)
            cout<<"0 ";
        else
            cout<<d[i]<<" ";
    }
    cout<<"\n";
}

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    dijkstra();
    afisare();
    return 0;
}