#include <fstream>
#include <bitset>
#include <queue>
#include <limits.h>
#include <vector>
using namespace std;
#define N 50001
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
int n,m,i,x,y,c,cost,vecin,d[N];
bitset<N>viz;
struct compare
{
    bool operator() (int x,int y)
    {
        return d[x]>d[y];
    }
};
priority_queue<int, vector<int>, compare>pq;
vector< pair<int,int> >G[N];

int main()
{
    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
    for(i=2; i<=n; i++)
        d[i]=INT_MAX;
    viz[i]=1;
    pq.push(1);
    while(!pq.empty())
    {
        x=pq.top();
        viz[x]=0;
        for(i=0; i<G[x].size(); i++)
        {
            vecin=G[x][i].first;
            cost=G[x][i].second;
            if(d[x]+cost<d[vecin])
            {
                d[vecin]=d[x]+cost;
                if(!viz[vecin])
                {
                    pq.push(vecin);
                    viz[vecin]=1;
                }
            }
        }
        pq.pop();
    }
    for(i=2; i<=n; i++)
        if(d[i]==INT_MAX)
            out<<0<<" ";
        else out<<d[i]<<" ";
}