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

using namespace std;

ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");

const int N=50005;
const int M=250005;
vector <pair <int, int>> v[N];
priority_queue <pair<int, int>> pq;
int dist[N];

void push (int x)
{
    for (auto vecin:v[x])
    {
        if (dist[vecin.first] > dist[x]+vecin.second)
        {
            dist[vecin.first]=dist[x]+vecin.second;
            pq.push(make_pair(dist[vecin.first], vecin.first));
        }
    }
}

int main()
{
    int n, m, x, y, c;
    cin >> n >> m;
    for (int i=1; i<=m; i++)
    {
        cin >> x >> y >> c;
        v[x].push_back(make_pair(y, c));
    }
    dist[1]=0;
    for (int i=2; i<=n; i++)
    {
        dist[i]=999999;
    }
    push(1);
    while (!pq.empty())
    {
        push(pq.top().second);
        pq.pop();
    }
    for (int i=2; i<=n; i++)
    {
        cout << dist[i] << " ";
    }
    return 0;
}