#include <cstdio>
#include <vector>
#include <queue>

#define NMAX 100005
#define INF 50000005

using namespace std;

queue <int>q;
vector <pair <int ,int > >v[NMAX];

int best[NMAX];
int n,m,nr,x,y,z;

void dijkstra(int nod){

    for (int i=2;i<=n;i++)
      best[i]=INF;

    q.push(nod);

   while (!q.empty()){
    int nodc=q.front();
    q.pop();

    for (auto it:v[nodc])
    if (best[it.first]>best[nodc]+it.second){
        best[it.first]=best[nodc]+it.second;
        q.push(it.first);
    }
   }
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);

    scanf("%d %d\n",&n,&m);

    for (int i=1;i<=m;i++){
        scanf("%d %d %d\n",&x,&y,&z);
        v[x].push_back(make_pair(y,z));
    }

    dijkstra(1);

    for (int i=2;i<=n;i++)
     printf("%d ",best[i]!=INF?best[i]:0);

    fclose(stdin);
    fclose(stdout);
}