#include <bits/stdc++.h>
#define N 50010
#define INF 2147483647

using namespace std;

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

int n, m, d[N];

queue <int> Q;
vector <pair <int, int> > graf[N];

void Read()
{
    int x, y, c;

    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y >> c;
        graf[x].push_back(make_pair(y, c));
    }
}

void Inf_vec()
{
    for(int i = 2; i <= n; i++)
        d[i] = INF;
}


void Print()
{
    for(int i = 2; i <= n; i++)
    {
        if(d[i] == INF)
            d[i] = 0;
        fout << d[i] << " ";
    }
}

void Dijkstra()
{
    int nod, vec, cost;
    Q.push(1);
    while(!Q.empty())
    {
        nod = Q.front();
        for(int i = 0; i < graf[nod].size(); i++)
        {
            vec = graf[nod][i].first;
            cost = graf[nod][i].second;
            if(d[nod] + cost < d[vec])
            {
                d[vec] = d[nod] + cost;
                Q.push(vec);
            }
        }
        Q.pop();
    }
}

int main()
{
    Read();
    Inf_vec();
    Dijkstra();
    Print();
    return 0;
}