#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
struct nod
{
    int x, c;
    bool operator<(nod n)const
    {
        return (c<n.c);
    }
    nod(){}
    nod(int xx, int cc)
    :x(xx), c(cc){}
};
vector<vector<nod>> G;
priority_queue<nod> h;
vector<int> res;
int n, m;
void rd()
{
    f>>n>>m;
    G.resize(n+1);
    res.resize(n+1, INT_MAX);
    int x, y, c;
    while(f>>x>>y>>c)
        G[x].push_back(nod(y, c));
    res[1]=0;
}
void Dijkstra()
{
    h.push(nod(1, 0));
    while(h.size())
    {
        int x=h.top().x;
        h.pop();
        for(auto a:G[x])
        {
            int y=a.x, c=a.c;
            if(res[y]>res[x]+c)
            {
                res[y]=res[x]+c;
                h.push(nod(y, res[y]));
            }
        }
    }
}
void afis()
{
    for(int i=2;i<=n;i++)
        g<<res[i]<<' ';
}
int main()
{
    rd();
    Dijkstra();
    afis();
    f.close();
    g.close();
    return 0;
}