#include<stdio.h>
#include<queue>
#include<vector>
#define inf 0x3f3f3f3f
using namespace std;
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q;
vector<pair<int,int> > v[50001];
int d[50001],u,x,i,n,a,b,c,m;
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&a,&b,&c);
        v[a].push_back(make_pair(b,c));
        
    }
    for(i=1;i<=n;i++)
        d[i]=inf;
    q.push(make_pair(0,1));
    d[1]=0;
    while(!q.empty())
    {
        u=q.top().first;
        x=q.top().second;
        q.pop();
        for(vector<pair<int,int> >:: iterator it=v[x].begin();it!=v[x].end();it++)
        {
            if(d[it->first]>u+it->second)
            {
                d[it->first]=u+it->second;
                q.push(make_pair(d[it->first],it->first));
            }
            
        }

    }
    for(i=2;i<=n;i++)
    {
        if(d[i]==inf)
            printf("0 ");
        else printf("%d ",d[i]);
    }
    return 0;
}