#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m;
bool f[50005];
vector<int> d;
vector<pair<int,int>> a[50005];
priority_queue<pair<int,int> , vector<pair<int,int>>, greater<pair<int,int>>> Q;

void citire()
{
    fin>>n>>m;
    d.resize(50005,1e5);
    for(int i=1; i<=m; i++)
    {
        int x,y,s;
        fin>>x>>y>>s;
        if(x==1) d[y]=s;
        a[x].push_back(make_pair(s,y));
    }
    d[1]=0;
    f[1]=1;
    for(auto i:a[1]){
        Q.push(i);
        d[i.second]=i.first;
    }
}

void ex()
{
    while(!Q.empty()){
        while(f[Q.top().second]==1)
            Q.pop();
        auto x=Q.top();
        Q.pop();
        f[x.second]=1;
        for(auto i:a[x.second])
            if(d[i.second]>d[x.second]+i.first)
                d[i.second] = d[x.second]+i.first;
    }
}

void afisare()
{
    for(int i=2; i<=n; i++)
        fout<<d[i]<<" ";
}

int main()
{
    citire();
    ex();
    afisare();
}