#include <bits/stdc++.h>
using namespace std;

const int MAXN = 50005;
const int INF = 0x3f3f3f3f;

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

int n, m;
int D[MAXN];
vector < pair <int, int> > G[MAXN];
queue <int> Q;

void Bellman()
{
    for (int i = 2; i <= n; ++i)
        D[i] = INF;
    Q.push(1);
    while (!Q.empty())
    {
        int node = Q.front();
        Q.pop();
        for (vector < pair <int, int> > :: iterator it = G[node].begin(); it != G[node].end(); ++it)
        {
            int v = it -> first;
            int cost = it -> second;
            if (D[v] > D[node] + cost)
            {
                D[v] = D[node] + cost;
                Q.push(v);
            }
        }
    }
    for (int i = 2; i <= n; ++i)
        fout << (D[i] > 0 ? D[i] : 0) << " ";
}

int main()
{
    fin >> n >> m;
    for (; m; --m)
    {
        int a, b, c;
        fin >> a >> b >> c;
        G[a].push_back( make_pair(b, c) );
    }
    Bellman();
    fin.close();
    fout.close();
    return 0;
}