#include <bits/stdc++.h>
using namespace std;
int n,m;
struct node
{
    int x,c;
    node(){}
    node(int B,int C)
    {
        x=B; c=C;
    }
};
#define NMAX 50005
#define pb push_back
vector < node > G[NMAX];
struct cmp
{
    int operator()(node a,node b)
    {
        return a.c<b.c;
    }
};
const int INF = (1<<30);
int D[NMAX];
bool used[NMAX];
void dijkstra(int start)
{
    priority_queue < node , vector<node> , cmp > H;
    for (int i=2;i<=n;i++)
        D[i]=INF;
    H.push(node(start,0));
    while (!H.empty())
    {
        node nod=H.top();
        H.pop();
        if (used[nod.x]) continue;
        used[nod.x]=true;
        vector<node>::iterator it;
        for (it=G[nod.x].begin();it!=G[nod.x].end();it++)
        {
            if (D[nod.x]+(it->c)<D[it->x])
            {
                D[it->x]=D[nod.x]+(it->c);
                H.push(node(it->x,D[it->x]));
            }
        }
    }
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d",&n,&m);
    int a,b,c;
    while (m--)
    {
        scanf("%d %d %d",&a,&b,&c);
        G[a].pb(node(b,c));
    }
    dijkstra(1);
    for (int i=2;i<=n;i++)
    {
        if (D[i]==INF)
            printf("0 ");
        else printf("%d ",D[i]);
    }
    return 0;
}