#include <bits/stdc++.h>

using namespace std;

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

const int Nmax=50005;
const int inf=(1<<30);

int n,m;
int Dist[Nmax];
bool Viz[Nmax];

vector < pair <int,int> > V[Nmax];

struct comparad
{
    bool operator()(int x,int y)
    {
        return V[x]>V[y];
    }
};

priority_queue < int, vector <int>, comparad > q;

void citire()
{
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int a,b,c;
        in>>a>>b>>c;
        V[a].push_back(make_pair(b,c));
    }
}

void dijkstra()
{
    for(int i=1; i<=n; i++)
        Dist[i]=inf;
    Dist[1]=0;
    q.push(1);
    Viz[1]=true;
    while(!q.empty())
    {
        int x=q.top();
        q.pop();
        Viz[x]=false;
        for(vector < pair <int,int> > :: iterator i=V[x].begin(); i!=V[x].end(); i++)
        {
            int vecin=(*i).first;
            int cost=(*i).second;
            if(Dist[x]+cost<Dist[vecin])
            {
                Dist[vecin]=Dist[x]+cost;
                if(Viz[vecin]==false)
                {
                    q.push(vecin);
                    Viz[vecin]=true;
                }
            }
        }
    }
}

void afisare()
{
    for(int i=2; i<=n; i++)
    {
        if(Dist[i]!=inf)
            out<<Dist[i]<<' ';
        else
            out<<0<<' ';
    }
}

int main()
{
    citire();
    dijkstra();
    afisare();
    return 0;
}