#include <cstdio>
#include <vector>
#include <queue>
#include <climits>
#define SIZE 50002
using namespace std;
struct node{
    int cost, p;
} a;
vector <node> v[SIZE];
queue <int> c;
int n, m, i, x, y, z, d[SIZE];

void sursa_unica()
{
    for(int i=2;i<=n;++i)
        d[i]=INT_MAX;
}

int main()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    scanf("%d %d", &n, &m);
    sursa_unica();

    for(i=1;i<=m;++i)
    {
        scanf("%d %d %d", &x, &y, &z);
        a.p=y; a.cost=z;
        v[x].push_back(a);
    }
    c.push(1);
    while(!c.empty())
    {
        x=c.front(); c.pop();
        for(i=0;i<v[x].size();++i)
            if(d[x]+v[x][i].cost<d[v[x][i].p])
            {
                d[v[x][i].p]=d[x]+v[x][i].cost;
                c.push(v[x][i].p);
            }
    }
    for(i=2;i<=n;++i)
        printf("%d ", d[i]);
    return 0;
}