#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int NMAX=50000;
const int INF= 1000000000;
struct graf
{
    int nod, cost;
    bool operator <(const graf&a) const{
        return cost>a.cost;
    }
};
int dist[NMAX+5];
vector <graf>G[NMAX+5];
priority_queue <graf>pq;
void Dijkstra()
{
    int i;
    graf a, b;
    dist[1]=0;
    a.nod=1;
    a.cost=0;
    pq.push(a);
    while(!pq.empty())
    {
        a=pq.top();
        pq.pop();
        if(a.cost>dist[a.nod])
            continue;
        else
        {
            for(i=0;i<G[a.nod].size();i++)
            {
                b.nod=G[a.nod][i].nod;
                b.cost=G[a.nod][i].cost;
                if(dist[a.nod]+b.cost<dist[b.nod])
                {
                    dist[b.nod]=dist[a.nod]+b.cost;
                    b.cost=dist[b.nod];
                    pq.push(b);
                }
            }
        }
    }
}
int main()
{
    int n, m, i, x;
    fin>>n>>m;
    graf a;
    for(i=2;i<=n;i++)
    {
       dist[i]=INF;
    }
    for(i=1;i<=m;i++)
    {
        fin>>x>>a.nod>>a.cost;
        G[x].push_back(a);
    }
    Dijkstra();
    for(i=2;i<=n;i++)
    {
        if(dist[i]==INF)
            fout<<"0"<<" ";
        else
            fout<<dist[i]<<" ";
    }
    return 0;
}