#include <fstream>
#include <vector>
#define oo 0x7fffffff
using namespace std;

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

int n, m;
bool b[50001];
int dist[50001];
vector<pair<int, int> > adj[50001];

void dijkstra(int node)
{
    for (int i = 0; i <= n; i++)
        dist[i] = oo;

    dist[node] = 0;
    while(true)
    {
        for (int i = 0; i < adj[node].size(); i++)
        {
            pair<int, int> next = adj[node][i];
            dist[next.first] = min(dist[next.first], dist[node] + next.second);
        }
        b[node] = 1;
        int mn = 0;
        for(int i = 1; i <= n; i++)
            if (dist[i] < dist[mn] && !b[i])
                mn = i;
        if (!mn)
            break;
        node = mn;
    }
}

int main()
{
    int x, y, c;

    fin >> n >> m;
    while (m--)
    {
        fin >> x >> y >> c;
        adj[x].push_back(make_pair(y, c));
    }

    dijkstra(1);
    for (int i = 2; i <= n; i++)
        if (dist[i] == oo)
            fout << "0 ";
        else
            fout << dist[i] << ' ';
}