#include <iostream>
#include <bits/stdc++.h>
#define inf (1 << 30)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
int n,m,f[100001],d[100001];

struct comparare
{
    bool operator() (int x, int y)
    {
        return d[x]>d[y];
    }
};

priority_queue <int, vector <int>, comparare> q;
vector <pair <int, int> > g[100001];
void read()
{
    fin >> n >> m;
    int x,y,cost;
    for(int i=1;i<=m;++i)
    {
        fin >> x >> y >> cost;
        g[x].push_back(make_pair(y, cost));
    }
}
void dijkstra()
{
    for(int i=1;i<=n;++i)
    {
        d[i]=inf;
    }
    d[1]=0;
    q.push(1);
    f[1]=1;
    while(!q.empty())
    {
        int nod = q.top();
        q.pop();
        f[nod]=0;
        for(size_t i=0;i<g[nod].size();++i)
        {
            int vecin = g[nod][i].first;
            int cost = g[nod][i].second;
            if(d[nod]+cost<d[vecin])
            {
                d[vecin]=d[nod]+cost;
                if(!f[vecin])
                {
                    q.push(vecin);
                    f[vecin]=1;
                }
            }
        }
    }
    for(int i=2;i<=n;++i)
    {
        if(d[i]!=inf)
            fout << d[i] << " ";
        else
            fout << 0 << " ";
    }
}
int main()
{
    read();
    dijkstra();
    return 0;
}