#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 50000;

int n, m;
int x, y, cost;
vector < pair<int,int> > v[NMAX+1];
int dist_min[NMAX+1];
int trecut[NMAX+1];

void calc_dist()
{
    for(int i=2; i<=n; i++)
        dist_min[i] = INT_MAX;
    dist_min[1] = 0;
    priority_queue < pair<int,int> , vector < pair<int,int> >, greater< pair<int,int> > > pq;
    pq.push(make_pair(0,1));
    while(!pq.empty())
    {
        pair <int,int> tp = pq.top();
        pq.pop();
        int nod = tp.second;
        int dist_cur = tp.first;
        trecut[nod] = 1;
        for(auto a : v[nod])
            if(!trecut[a.second])
                if(dist_min[a.second] > dist_min[nod] + a.first)
                {
                    dist_min[a.second] = dist_min[nod] + a.first;
                    pq.push(make_pair(dist_min[a.second], a.second));
                }
    }
}


int main()
{
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        fin >> x >> y >> cost;
        v[x].push_back(make_pair(cost,y));
    }
    calc_dist();
    for(int i=2; i<=n; i++)
        if(dist_min[i] == INT_MAX)fout << 0 << ' ';
        else fout << dist_min[i] << ' ';
    return 0;
}