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

using namespace std;

int dist[50050];

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

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,x,y,c,j=0;
    cmp node,n1;
    scanf("%d%d",&n,&m);
    for(i=1; i<=m; i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        g[x].push_back(make_pair(y,c));
    }
    for(i=0; i<=n; i++)
        dist[i]=inf;
    dist[1]=0;
    node.t=1;
    pq.push(node);
    while(!pq.empty())
    {
        node=pq.top();
        pq.pop();
        if(viz[node.t]==false)
        {
            j++;
            viz[node.t]=true;
            for(i=0; i<g[node.t].size(); i++)
            {
                if(dist[node.t]+g[node.t][i].second<dist[g[node.t][i].first])
                {
                    dist[g[node.t][i].first]=dist[node.t]+g[node.t][i].second;
                    n1.t=g[node.t][i].first;
                    pq.push(n1);
                }
            }
        }
    }
    for(i=2; i<=n; i++)
    {
        if(dist[i]!=inf)
            printf("%d ",dist[i]);
        else
            printf("0 ");
    }
    return 0;
}