#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

const int MAX = 50000;
const int lim = 250000;

int n,m,d[MAX+1];
bool Incoada[MAX+1];
vector < pair <int,int> > g[MAX+1];

struct compar
{
    bool operator()(int x, int y)
    {
        return d[x]>d[y];
    }
};
priority_queue<int, vector<int>, compar> coada;

void dijkstra (int start)
{
    for(int i=1; i<=n; ++i)
        d[i]=lim;
    d[start]=0;
    coada.push(start);
    Incoada[start]=true;
    while(!coada.empty())
    {
        int curent=coada.top();
        coada.pop();
        Incoada[curent]=false;
        for(int i=0; i<=g[curent].size(); ++i)
        {
            int vecin = g[curent][i].first;
            int cost = g[curent][i].second;
            if( d[curent]+cost<d[vecin] )
            {
                d[vecin]=d[curent]+cost;
                if(Incoada[vecin]==false)
                {
                    coada.push(vecin);
                    Incoada[vecin]=true;
                }
            }

        }
    }
}
int main()
{
    cin>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        int a,b,c;
        cin>>a>>b>>c;
        g[a].push_back(make_pair(b, c));
    }
    dijkstra(1);
    for(int i=2; i<=n; ++i)
    {
        if(d[i]!=lim)
            cout<<d[i]<<" ";
        else
            cout<<0<<" ";
    }
    return 0;
}