#include <fstream>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <numeric>
#define nmax 50005
#define inf 20005
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

int n, m, x, y, c, viz[nmax], d[nmax];
vector<pair<int,int>> liste[nmax];
set<pair<int,int>> s;


void bfs(int start)
{
    for(int i=1; i<=n; i++)
        d[i]=inf;
    s.insert({0,start});
    d[start]=0;
    while(s.size())
    {
        int nod=(*s.begin()).second;
        s.erase(s.begin());
        if(viz[nod])
            continue;
        viz[nod]=1;
        for(auto vec : liste[nod])
        {
            int nnod=vec.second;
            int ccost=vec.first;
            if(d[nnod]>d[nod]+ccost)
            {
                d[nnod]=d[nod]+ccost;
                s.insert({d[nnod],nnod});
            }
        }
    }
    for(int i=2; i<=n; i++)
        if(d[i]!=inf)
            cout<<d[i]<<' ';
        else cout<<0<<' ';
}

int main()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y>>c;
        liste[x].push_back({c,y});
    }
    bfs(1);
    return 0;
}