#include <fstream>
#include <queue>
#include <vector>
#include <utility>

#define inf 1e9

using namespace std;

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

priority_queue< pair<int,int> , vector<pair<int,int> >,greater<pair<int,int> > >h;

int n,m;

vector<pair<int,int> > v[50001];

long long d[50001];

bool viz[50001];

int main()
{
    f>>n>>m;

    for(int i=2;i<=n;++i)
        d[i]=inf;

    for(int i=1;i<=m;++i)
    {
        int a,b,c;
        f>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }

    h.push(make_pair(1,0));

    while(!h.empty())
    {

        int nod = h.top().first;
        h.pop();
        if(!viz[nod])
        {

            viz[nod]=true;
            for(int i=0;i<v[nod].size();++i)
            {

                if(d[nod]+v[nod][i].second<d[v[nod][i].first])
                    {
                        d[v[nod][i].first]=d[nod]+v[nod][i].second;
                        h.push(make_pair(v[nod][i].first,d[v[nod][i].first]));
                    }

            }

        }

    }

    for(int i=2;i<=n;++i)
    {
        if(d[i]==inf)g<<"0 ";
        else g<<d[i]<<" ";
    }

    return 0;
}
//#588 1887 591 pebeinfo