#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#define x first
#define y second
#define inf 2000000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int i,j,n,m,a,b,d,now,z,c[50010];
vector <pair<int,int> > v[50010];
queue <int> q;
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
        fin>>a>>b>>d,v[a].push_back(make_pair(b,d));
    for(i=2;i<=n;i++)
        c[i]=inf;
    q.push(1);
    while(!q.empty())
    {
        now=q.front();
        z=v[now].size();
        for(i=0;i<z;i++)
            if(c[v[now][i].x]>c[now]+v[now][i].y)
                c[v[now][i].x]=c[now]+v[now][i].y,q.push(v[now][i].x);
    }
    for(i=2;i<=n;i++)
        if(c[i]==inf)
            fout<<0<<" ";
        else
            fout<<c[i]<<" ";
    return 0;
}