#include <fstream>
#include <queue>
#include <vector>

using namespace std;

const int N = 50000;
const int INF = 1 << 30;

struct succesor
{
    int vf, c;
};

vector <succesor> s[N+1];
vector <int> d;
vector <bool> sel;
int n, m;

void dijkstra(int x0)
{
    d.resize(n + 1, INF);
    sel.resize(n + 1, false);
    priority_queue < pair <int, int>, vector <pair <int, int>>, greater <pair <int, int>>> h;
    d[x0] = 0;
    h.push({0, x0});
    while (!h.empty())
    {
        pair <int, int> p = h.top();
        h.pop();
        int c = p.first, x = p.second;
        if (c != d[x])
        {
            continue;
        }
        for (auto p_s: s[x])
        {
            int y = p_s.vf;
            int c = p_s.c;
            if (d[x] + c < d[y])
            {
                d[y] = d[x] + c;
                h.push({d[y], y});
            }
        }
    }
}

int main()
{
    ifstream in("dijkstra.in");
    ofstream out("dijkstra.out");
    in >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y, c;
        in >> x >> y >> c;
        s[x].push_back((succesor){y, c});
    }
    dijkstra(1);
    for (int i = 2; i <= n; i++)
    {
        if (d[i] == INF)
        {
            d[i] = 0;
        }
        out << d[i] << " ";
    }
    in.close();
    out.close();
    return 0;
}