#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <unordered_map>
#include <functional>
//#include <conio.h>
#define pb push_back
#define mp make_pair
#define MOD 9901
#define newl printf("\n")
#define NMAX 50005
#define nst (nod<<1)
#define ndr (nst+1)
#define vi vector<int>
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
int n,m,D[NMAX];
vector < pii > G[NMAX];
priority_queue < pii > h;
const int INF = (1<<30);
bool used[NMAX];
void dijkstra(int start)
{
    pii nod;
    vector < pii >::iterator it;
    for (int i=2;i<=n;i++) D[i]=INF;
    h.push(mp(0,start));
    while (!h.empty())
    {
        nod=h.top();
        h.pop();
        int x=nod.se;
        if (used[x]) continue;
        used[x]=true;
        for (it=G[x].begin();it!=G[x].end();it++)
        {
            if (it->se+D[nod.se]<D[it->fi])
            {
                D[it->fi]=it->se+D[nod.se];
                h.push(mp(-D[it->fi],it->fi));
            }
        }
    }
    for (int i=2;i<=n;i++) printf("%d ",D[i]);
}
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(mp(b,c));
    }
    dijkstra(1);
    return 0;
}