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

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int NMax = 50005;
int N, M;
int D[NMax];
bool marca[NMax];
vector < pair <int,int> > v[NMax];
struct compara
{
    bool operator()(int x, int y)
    {
        return D[x] > D[y];
    }
};
priority_queue<int, vector<int>, compara> q;
void Citeste()
{
    f >> N >> M;
    for(int i = 1; i <= M; i++)
    { int x, y, c;
        f>> x >> y >> c;
        v[x].push_back(make_pair(y,c));
    }
}
void Dijkstra()
{    int x;
int nod ,cost;
        D[1]=0;
        q.push(1);
        marca[1]=true;
        while(!q.empty())
        {
            x=q.top();
            q.pop();
            for(int i=0;i<v[x].size();i++)
            {
                nod=v[x][i].first;
                cost=v[x][i].second;
                if(D[x]+cost<D[nod]||D[nod]==0){
                        D[nod]=D[x]+cost;
                        q.push(nod);
                }
            }
        }
}
void Afiseaza()
{
    for(int i = 2; i <= N; i++)
    {
        if(D[i] != 0)
            g<< D[i] << " ";
        else
            g<< "0 ";
    }
}
int main()
{
    Citeste();
    Dijkstra();
    Afiseaza();
}