#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <algorithm>

using namespace std;

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

const int NMAX=50005;

priority_queue <pair <int,int>> q;

vector <pair <int,int>> graf[NMAX];

int n,m,sol[NMAX];

void citire()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        in>>x>>y>>z;
        graf[x].push_back({y,z});
    }
}

void bfs()
{
    q.push({1,0});
    while(!q.empty())
    {
        int nownod=q.top().first;
        q.pop();
        int nr=graf[nownod].size();
        for(int i=0;i<nr;i++)
        {
            pair <int,int> nextnod=graf[nownod][i];
            int nod=nextnod.first;
            int val=nextnod.second;
            int sum=sol[nownod]+val;
            if(sum<sol[nod])
            {
                q.push({nod,-val});
                sol[nod]=sum;
            }
            else if(sol[nod]==0)
            {
                q.push({nod,-val});
                sol[nod]=sum;
            }
        }
    }
}

void afisare()
{
    for(int i=2;i<=n;i++)
    {
        out<<sol[i]<<" ";
    }
}

int main()
{
    citire();
    bfs();
    afisare();
    return 0;
}