#include <fstream>
#include <vector>
#include <functional>
#include <queue>
#define NMAX 50002
#define INF 1000000004

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct varf
{
    int x, c;
    friend bool operator>(const varf&, const varf&);
};

bool operator >(const varf& a, const varf& b)
{
    return a.c > b.c;
}

priority_queue <varf, vector <varf>, greater<varf> > H;

int n, m, cmin[NMAX];
bool v[NMAX];
vector <varf> LA[NMAX];
void citire();
void dijkstra();
void afisare();

int main()
{
    citire();
    dijkstra();
    afisare();
    return 0;
}
void citire()
{
    int i, x, y, c;
    varf a;
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>x;
        fin>>a.x>>a.c;
        LA[x].push_back(a);
    }
}
void dijkstra()
{
    int i, j, vf, cost;
    varf minn;
    minn.x=1; minn.c=0;
    H.push(minn);
    for (i=0; i<=n; i++)
        cmin[i]=INF;
    cmin[1]=0;
    while (!H.empty())
    {
        minn=H.top();
        H.pop();
        if (minn.c==INF) break;
        if (!v[minn.x])
        {v[minn.x]=1;

        for (j=0; j<LA[minn.x].size(); j++)
        {
            vf=LA[minn.x][j].x;
            cost=LA[minn.x][j].c;
            if (cmin[minn.x]+cost<cmin[vf])
            {
                cmin[vf]=cmin[minn.x]+cost;
                H.push({vf, cmin[vf]});
            }
        }}
    }
}
void afisare()
{
    int i;
    for (i=2; i<=n; i++)
    if(cmin[i]!=INF)
        fout<<cmin[i]<<" ";
        else fout<<0<<" ";
}