#include <bits/stdc++.h>

using namespace std;
const int NMAX = 50000;

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

void Next();
void Get(int &x);

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    Get(n);
    Get(m);
    for(int i=1; i<=m; i++)
    {
        Get(x); Get(y); Get(cost);
        v[x].push_back(make_pair(cost, y));
    }
    for(int i=2; i<=n; i++)
        dist_min[i] = INT_MAX;
    queue < pair<int,int> > q;
    dist_min[1] = 0;
    in_queue[1] = 1;
    nr_entrances[1] = 1;
    q.push(make_pair(0,1));
    while(!q.empty())
    {
        auto f = q.front();
        q.pop();
        int nod = f.second;
        int dist_cur = f.first;
        in_queue[f.second] = 0;
        for(auto a : v[nod])
            if(dist_min[a.second] > dist_min[nod] + a.first)
            {
                dist_min[a.second] = dist_min[nod] + a.first;
                if(!in_queue[a.second])
                {
                    in_queue[a.second] = 1;
                    q.push(make_pair(dist_min[a.second], a.second));
                }
            }
    }
    for(int i=2; i<=n; i++)
        if(dist_min[i] == INT_MAX)cout << 0 << ' ';
        else cout << dist_min[i] << ' ';
    return 0;
}

const int len = 1000001;
int u = len-1;
char S[len];

void Next()
{
    if(++u == len)  
        fread(S, 1, len, stdin), u = 0;
}

void Get(int &x)
{
    x = 0;
    for(; S[u] < '0' || S[u] > '9'; Next());
    for(; S[u] >= '0' && S[u] <='9'; Next())
        x = x*10 + S[u]-'0';
}