#include <cstdio>
#include <queue>
#include <vector>
#define NMAX 50000
#define inf 0x3f3f3f3f
using namespace std;

int n,m,i,D[NMAX+5],sum;
bool used[NMAX+5];
vector < pair < int, int> > G[NMAX+5];
priority_queue < pair < int, int> , vector <pair < int, int> >, greater <pair < int, int> > >H;

void solve()
{
    int node,i,s,son,cost;
    for(i=2; i<=n; ++i)
        D[i]=inf;
    H.push(make_pair(0,1));
    while(!H.empty())
    {
        node=H.top().second;
        H.pop();
        used[node]=1;
        if(!G[node].empty())
        {
            s=G[node].size();
            for(i=0; i<s; ++i)
            {
                son=G[node][i].second;
                cost=G[node][i].first;
                if(!used[son] && D[son]>D[node]+cost)
                {
                    D[son]=D[node]+cost;
                    H.push(make_pair(D[son],son));
                }
            }
        }
    }
}

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1; i<=m; ++i)
    {
        int x,y,c;
        scanf("%d%d%d",&x,&y,&c);
        G[x].push_back(make_pair(c,y));
    }
    solve();
    for(i=2; i<=n; ++i)
    {
        if(D[i]==inf)
            printf("0 ");
        else printf("%d ",D[i]);
    }
    printf("\n");
    return 0;
}