#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijsktra.out");

int n,m;
int D[50005];
vector<pair<int,int> > lista[50005];

void read()
{
    fin>>n>>m;
    int x,y,c;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        lista[x].push_back({y,c});
    }
}

struct compara
{
    bool operator()(int x,int y)
    {
        return D[x]>D[y];
    }
};

priority_queue<int,vector<int>,compara> q;

void Dijkstra(int start)
{
    for(int i=1;i<=n;i++)
        D[i]=INF;
    q.push(start);
    D[start]=0;
    while(!q.empty())
    {
        int nod=q.top();
        q.pop();
        for(auto x:lista[nod])
        {
            int vecin=x.first;
            int cost=x.second;
            if(D[vecin]>D[nod] +cost)
            {
                D[vecin]=D[nod]+cost;
                q.push(vecin);
            }
        }
    }
}

void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(D[i]!=INF)
            fout<<D[i]<<" ";
        else
            fout<<0<<" ";
    }
}


int main()
{
    read();
    Dijkstra(1);
    afisare();
    return 0;
}