#include<cstdio>
#include<queue>
#include<vector>
#define maxN 50001
#define M 1<<30
using namespace std;
FILE* f=fopen("dijkstra.in","r");
FILE *g=fopen("dijkstra.out","w");
struct nod{
    int inf,c;
};
int n,m,cost[maxN];
struct cmp{
    bool operator()(nod a, nod b)
    {
        return cost[a.inf]>cost[b.inf];
    }
};
vector<nod>v[maxN];
priority_queue<nod,vector<nod>,cmp>heap;

void citire()
{
    nod a;
    int i,x,y,z;
    fscanf(f,"%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(f,"%d%d%d",&x,&y,&z);
        a.inf=y;
        a.c=z;
        v[x].push_back(a);
    }
    for(i=2;i<=n;i++)
        cost[i]=M;
}
void dijkstra()
{
    nod a;
    int i,nod_cur;
    a.inf=1;
    a.c=0;
    heap.push(a);
    while(!heap.empty())
    {
        nod_cur=heap.top().inf;
        heap.pop();
        for(i=0;i<v[nod_cur].size();i++)
        {
            if(cost[v[nod_cur][i].inf]>cost[nod_cur]+v[nod_cur][i].c)
            {
                cost[v[nod_cur][i].inf]=cost[nod_cur]+v[nod_cur][i].c ;
                heap.push(v[nod_cur][i]);
            }
        }
    }
}
void afisare()
{
    int i;
    for(i=2;i<=n;i++)
    {
        if(cost[i]==M)fprintf(g,"0 ");
        else fprintf(g,"%d ",cost[i]);
    }
}
int main()
{
    citire();
    dijkstra();
    afisare();
    return 0;
}