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

vector <pair<int,int> > lv[50001];
int d[50001];
struct comp{bool operator()(int x,int y){return d[x]>d[y];}};
priority_queue <int, vector<int>,comp> q;
bool is_in_q[50001];

int main()
{
    int n,m,i,x,y,c,nod,l;
    FILE *f=fopen("dijkstra.in","r");
    fscanf(f,"%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(f,"%d%d%d",&x,&y,&c);
        lv[x].push_back(make_pair(y,c));
    }
    for(i=1;i<=n;i++)
        d[i]=inf;
    d[1]=0;is_in_q[1]=1;
    q.push(1);
    while(!q.empty())
    {
        x=q.top();q.pop();
        is_in_q[x]=0;
        for(auto &ii:lv[x])
        {
            nod=ii.first;l=ii.second;
            if(d[x]+ l < d[nod])
            {
                d[nod]=d[x]+ l;
                if(!is_in_q[nod])
                {
                    q.push(nod);
                    is_in_q[nod]=1;
                }
            }
        }
    }
    f=fopen("dijkstra.out","w");
    for(i=2;i<=n;i++)
        fprintf(f,"%d ",d[i]==inf?0:d[i]);
    return 0;
}