#include <bits/stdc++.h>

using namespace std;

int n,m,i,cost[50005];
vector < pair <int,int> > v[50005];
queue <int> coada;

void bfs()
{
    coada.push(1);
    while (!coada.empty())
    {
        int nod=coada.front();
        coada.pop();
        for (int i=0; i<v[nod].size(); i++)
        {
            if (cost[v[nod][i].first]>cost[nod]+v[nod][i].second || cost[v[nod][i].first]==0) cost[v[nod][i].first]=cost[nod]+v[nod][i].second;
            coada.push(v[nod][i].first);
        }
    }
}

int main() 
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin>>n>>m;
    for (i=1; i<=m; i++)
    {
        int a,b,c;
        cin>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
    
    bfs();
    
    for (i=2; i<=n; i++)
    cout<<cost[i]<<" ";
}