// Dijkstra - O(MlogN)
// d[nod] = lungimea drumului minim de la Sursa la nod
// ante[nod] = nodul dinaintea lui nod pe drumul minim S-...-ante[nod]-nod-...F
#include <fstream>
#include <vector>
#include <queue>
#define Nmax 50009
#define oo 2000000000
using namespace std;
ifstream f("dijkstra.in");  ofstream g("dijkstra.out");

int N,M,S,F,d[Nmax],ante[Nmax],incoada[Nmax];
struct muchie{int y,c;};
vector < muchie > Graph[Nmax];

struct cmp
{ bool operator()(int x,int y){   return d[x]>d[y];   };
};
priority_queue < int  , vector < int > , cmp > pq;


void Dijkstra(int S)
{
    for(int i=1;i<=N;++i)d[i]=oo,ante[i]=oo;
    d[S]=ante[S]=0;
    incoada[S]=1;
    for(pq.push(S); !pq.empty(); pq.pop() )
    {
        int nod=pq.top();
		vector<muchie>::iterator it;
        for(it=Graph[nod].begin() ; it!=Graph[nod].end() ; ++it)
            if(d[nod]+it->c < d[it->y])
            {
                d[it->y]=d[nod]+it->c;
                ante[it->y]=nod;
                pq.push(it->y);
            }
    }
    for (int i=1; i<=N; ++i)
        if (d[i]==oo)d[i]=0,ante[i]=0;
}





void ReadInput(),Rebuild(int nod);
int main()
{
    ReadInput();
    Dijkstra(S);
    for(int i=2;i<=N;++i)g<<d[i]<<' ';
    g<<'\n';
    f.close();g.close();
    return 0;
}

void Rebuild(int nod)
{
    if(nod==S){ g<<S<<' '; return; }
    Rebuild(ante[nod]);
    g<<nod<<' ';
}

void ReadInput()
{
    f>>N>>M>>S>>F;
    for(int i=1;i<=M;++i)
    {
        int x,y,c; muchie aux;
        f>>x>>y>>c;
        aux.y=y,aux.c=c;
         Graph[x].push_back(aux);
    }
}