#include <bits/stdc++.h>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
/** /// PARCURGERE BF
int a,b,n,m;
class graph
{
    int nr;
    vector<int> *v;
public:
    graph(int nr);
    void adauga(int x, int y);
    void bfs(int k);
};
graph::graph(int nr)
{
    this->nr=nr;
    v=new vector<int>[nr];
}
void graph::adauga(int x, int y)
{
    v[x].push_back(y);
    v[y].push_back(x);
}
void graph::bfs(int k)
{
    bool *viz=new bool(nr);
    for(int i=0;i<nr;i++)
        viz[i]=false;
    queue<int> q;
    viz[k]=1;
    q.push(k);
    while(!q.empty())
    {
        k=q.front();
        g<<k<<'\n';
        q.pop();
        for(int i=0;i<v[k].size();i++)
        if(!viz[v[k][i]])
        {
            viz[v[k][i]]=true;
            q.push(v[k][i]);
        }
    }
}
int main()
{
    f>>n>>m;
    n++;
    graph g(n);
    for(int i=1;i<=m;i++)
    {
        f>>a>>b;
        g.adauga(a,b);
    }
    g.bfs(1);
    return 0;
}
**/

/** /// PARCURGERE DF
int n,m,a,b;
class graph
{
    int nr;
    vector<int> *v;
public:
    graph(int nr);
    void adauga(int x, int y);
    void dfs(int k);
};
graph::graph(int nr)
{
    this->nr=nr;
    v=new vector<int>[nr];
}
void graph::adauga(int x, int y)
{
    v[x].push_back(y);
    v[y].push_back(x);
}
void graph::dfs(int k)
{
    vector<bool> viz(nr,false);
    stack<int> s;
    s.push(k);
    while(s.size())
    {
        k=s.top();
        s.pop();
        if(!viz[k])
        {
            viz[k]=true;
            g<<k<<'\n';
        }
        for(int i=0;i<v[k].size();i++)
            if(!viz[v[k][i]]) s.push(v[k][i]);
    }
}
int main()
{
    f>>n>>m;
    n++;
    graph g(n);
    for(int i=1;i<=m;i++)
    {
        f>>a>>b;
        g.adauga(a,b);
    }
    g.dfs(1);
    return 0;
}
**/

/// ALGORITMUL DIJKSTRA
#define INF 0x3f3f3f3f
typedef pair<int,int> T;
int n,m,a,b,cost;
class graph
{
    int nr;
    vector<T> *v;
public:
    graph(int nr);
    void adaugare(int x, int y, int c);
    void dijkstra(int k);
};
graph::graph(int nr)
{
    this->nr=nr;
    v=new vector<T>[nr];
}
void graph::adaugare(int x, int y, int c)
{
    v[x].push_back({y,c});
    ///v[y].push_back({x,c});
}
void graph::dijkstra(int k)
{
    priority_queue <T,vector<T>,greater<T> > pq;
    vector<int> dist(nr,INF);
    vector<int> viz(nr,false);
    pq.push({0,k});
    dist[k]=0; int ok=0;
    while(pq.size())
    {
        int nod=pq.top().second;
        pq.pop();
        if(viz[nod]==nr)
        {
            ok=1;
            break;
        }
        for(int i=0;i<v[nod].size();i++)
        {
            int nodi=v[nod][i].first;
            int w=v[nod][i].second;

            if(dist[nodi]>dist[nod]+w)
            {
                dist[nodi]=dist[nod]+w;
                pq.push({dist[nodi],nodi});
                viz[nodi]++;
            }
        }
    }
    for(int i=2;i<nr;i++)
        g<<dist[i]<<" ";
}
int main()
{
    f>>n>>m;
    //n++;
    graph g(n+1);
    for(int i=1;i<=m;i++)
    {
        f>>a>>b>>cost;
        g.adaugare(a,b,cost);
    }
    g.dijkstra(1);
    return 0;
}


/** /// ALGORITMUL LUI PRIM
#define INF 0x3f3f3f3f
typedef pair<int,int> T;
int n,m,a,b,cost;
class graph
{
    int nr;
    vector<
};
int main()
{
    f>>n>>m;
    n++;
    graph g(n);
    for(int i=1;i<=m;i++)
    {
        f>>a>>b>>cost;
        g.adaugare(a,b,cost);
    }
    g.prim(1);
    return 0;
}**/