#include <cstdio>
#include <queue>
#include <vector>
#define inf 200050

using namespace std;

int dist[50050];

struct cmp
{
    int node;
    const bool operator < (const cmp &x)const
    {
        return dist[node]>dist[x.node];
    }
};

vector< vector< pair<int,int> > >g(50050);
priority_queue<cmp> pq;
bool viz[50050];

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    int n,m,i,x1,y1,c,node,j=0;
    cmp x,y;
    scanf("%d%d",&n,&m);
    for(i=1; i<=m; i++)
    {
        scanf("%d%d%d",&x1,&y1,&c);
        g[x1].push_back(make_pair(y1,c));
    }
    for(i=0; i<=n; i++)
        dist[i]=inf;
    dist[1]=0;
    x.node=1;
    pq.push(x);
    while(!pq.empty())
    {
        x=pq.top();
        pq.pop();
        for(i=0; i<g[x.node].size(); i++)
        {
            if(dist[x.node]+g[x.node][i].second<dist[g[x.node][i].first])
            {
                dist[g[x.node][i].first]=dist[x.node]+g[x.node][i].second;
                y.node=g[x.node][i].first;
                pq.push(y);
            }
        }
    }
    for(i=2; i<=n; i++)
    {
        if(dist[i]!=inf)
            printf("%d ",dist[i]);
        else
            printf("0 ");
    }
    return 0;
}