#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
const int NMAX=50005;
const int inf=20000000;
struct drum
{
    int d;
    int l;
};
vector<drum> v[NMAX];
queue<int> q;
int minn[NMAX];

void dijkstra()
{
    q.push(1);
    int x,n,i;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        n=v[x].size();
        for(i=0;i<n;++i)
        {
            if(minn[v[x][i].d]>minn[x]+v[x][i].l)
            {
                minn[v[x][i].d]=minn[x]+v[x][i].l;
                q.push(v[x][i].d);
            }
        }
    }
}

int main()
{
    ifstream si;
    si.open("dijkstra.in");
    ofstream so;
    so.open("dijkstra.out");
    int n,m;
    si>>n>>m;
    int i,a,b,c;
    for(i=0;i<m;++i)
    {
        si>>a>>b>>c;
        v[a].push_back({b,c});
    }
    for(i=2;i<=n;++i)
        minn[i]=inf;
    dijkstra();
    for(i=2;i<=n;++i)
        if(minn[i]==inf)
            so<<0<<' ';
        else
            so<<minn[i]<<' ';
    so<<'\n';
}