#include <fstream>
#include <vector>
#include <utility>
#include <queue>
#define NMAX 100005
#define INF 999999999
#define pb push_back
#define mp make_pair
#define d first
#define nd second

using namespace std;
typedef pair<int,int> Pair;
FILE* f=freopen("dijkstra.in","r",stdin);
FILE* o=freopen("dijkstra.out","w",stdout);

int n,m;
vector<Pair> G[NMAX];
int dist[NMAX];
priority_queue<Pair, vector<Pair>, greater<Pair> > q;

void Dijkstra(int x)
{
    for(int i=2;i<=n;++i)
    {
        dist[i]=INF;
    }
    q.push(mp(0,1));
    while(true)
    {
        while(!q.empty()&&q.top().d!=dist[q.top().nd])
            q.pop();
        if(q.empty()) break;
        Pair nod=q.top();
        q.pop();
        for(int i=0;i<G[nod.nd].size();++i)
        {
            Pair ind=G[nod.nd][i];
            if(dist[ind.nd]>dist[nod.nd]+ind.d) {
                dist[ind.nd]=dist[nod.nd]+ind.d;
                q.push(mp(dist[ind.nd],ind.nd));
            }
        }
    }
}

int main()
{
    scanf("%d%d",&n,&m);

    for(int i=0;i<m;++i)
    {
        int x,y,d;
        scanf("%d%d%d",&x,&y,&d);

        G[x].pb(mp(d,y));
    }

    Dijkstra(1);

    for(int i=2;i<=n;++i)
        printf("%d ",dist[i]);

    return 0;
}