#include <cstdio>
#include <queue>
#include <vector>
#include <climits>
#define r1 50001
#define inf INT_MAX/2
using namespace std;

priority_queue<pair<int,int> > q;
vector <pair<int ,int>  > nods[r1];
vector<pair<int,int> > :: iterator it;
int n,m,dist[r1];

FILE *f1,*f2;
int main()
{
    f1=fopen("dijkstra.in","r");
    f2=fopen("dijkstra.out","w");
    fscanf(f1,"%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fscanf(f1,"%d%d%d",&a,&b,&c);
        nods[a].push_back(make_pair(b,c));
    }
    for(int i=2;i<=n;i++)
    {
        dist[i]=inf;
    }
    dist[1]=0;
    q.push(make_pair(0,1));
    while(!q.empty())
    {
        int x=-q.top().first,c=q.top().second;
        q.pop();
        for(it=nods[c].begin();it!=nods[c].end();++it)
        {
            if(dist[it->first]>x+it->second)
            {
               dist[it->first]=x+it->second;
               q.push(make_pair(-dist[it->first],it->first));
            }
        }
    }
    for(int i=2;i<=n;i++)
        fprintf(f2,"%d ",dist[i]<inf?dist[i]:0);
    return 0;
}