#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

#define MAX 250020
#define inf 1<<30
vector < pair < int , int> >:: iterator it;
vector < pair < int , int > >v[MAX];
queue < int > q;
int a[MAX],n,m;

void dij()
{
    for(int i=2;i<=n;i++)
        a[i]=inf;
    q.push(1);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(it = v[nod].begin() ; it != v[nod].end() ; it++)
        {
            int nou=it->first;
            if(a[nou] >= a[nod] + it->second)
            {
                a[nou]=a[nod] + it->second;
                q.push(nou);
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(a[i] < inf)
            fout<<a[i]<<" ";
        else
            fout<<0<<" ";
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
    dij();
    fin.close();
    fout.close();
    return 0;
}