#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>

#define inf  200000
using namespace std;

priority_queue<pair<int,int> > q;
vector<pair<int,int> >lv[50005];
vector<pair<int,int> >::iterator ii;
int d[50005];
int N,M;
void read()
{
    freopen("dijkstra.in","r",stdin);
    scanf("%d%d",&N,&M);
    for(int i=1;i<=M;i++)
    {
        int x,y,c;
        scanf("%d%d%d",&x,&y,&c);
        lv[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=N;i++)
        d[i]=inf;

}

void dijkstra()
{
    q.push(make_pair(0,1));
    while(!q.empty())
    {
        int x = q.top().second;
        int c = -q.top().first;
        q.pop();
        for(ii=lv[x].begin();ii!=lv[x].end();++ii)
        {
            if(c+ii->second < d[ii->first])
            {
                d[ii->first] = c+ii->second;
                q.push(make_pair(-d[ii->first],ii->first));
            }
        }
    }
}


int main()
{
    read();
    dijkstra();
    freopen("dijkstra.out","w",stdout);
    for(int i=2;i<=N;i++)
        printf("%d ",d[i]<inf?d[i]:0);
    return 0;
}