#include <fstream>
#include <vector>
#include <queue>
const int NMAX=50005;

using namespace std;

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

int ans[NMAX];
vector<pair<int,int>> adjNod[NMAX];

void bfs(int n)
{
    queue<int> coada;
    for(int i=1;i<=n;i++) ans[i]=1e9;
    coada.push(1);
    ans[1]=0;
    while(!coada.empty())
    {
        int nod=coada.front();
        coada.pop();
        for(auto i:adjNod[nod])
        {
            if(ans[nod]+i.second<ans[i.first])
            {
                ans[i.first]=ans[nod]+i.second;
                coada.push(i.first);
            }
        }
    }
}

int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int nod1,nod2,dist;
        cin>>nod1>>nod2>>dist;
        adjNod[nod1].push_back({nod2,dist});
    }
    bfs(n);
    for(int i=2;i<=n;i++) cout<<ans[i]<<" ";
    return 0;
}