#include <bits/stdc++.h>
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

vector<pair<int, int> > l[50001];
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > q;
int inf=20001;
int n, m, a, b, c, v[50001], d[50001], mnp;


int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>a>>b>>c;
        l[a].push_back(make_pair(b, c));
    }
    for(int i=1;i<=n;i++)
    {
        d[i]=inf;
    }
    d[1]=0;
    q.push(make_pair(0, 1));
    while(!q.empty())
    {
        mnp=q.top().second;
        q.pop();
        v[mnp]=1;
        for(int j=0;j<l[mnp].size();j++)
        {
            //cout<<mnp<<" ";
            int vecin=l[mnp][j].first;
            int cvecin=l[mnp][j].second;
            if(d[vecin]>d[mnp]+cvecin)
            {
                d[vecin]=d[mnp]+cvecin;
                q.push(make_pair(d[mnp]+cvecin, vecin));
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==inf)
            d[i]=0;
        g<<d[i]<<" ";
    }
    return 0;
}