#include<cstdio>
#include<cstring>
#define N 30001
typedef struct nod
{int info,cost;
struct nod *next;}Nod;
struct P
{int a,b;};
P s[N];
Nod *l[N],*t;
int i,n,m,x,y,j,p,u,c[N],k,o,q,e;
 
void A(int i,int j,int k)
{Nod *p=new Nod;
p->info=j;
p->cost=k;
p->next=l[i];
l[i]=p;}
 
int B(int i,int j)
{Nod *p;
for(p=l[i];p;p=p->next)
if(p->info==j)
      return p->cost;
return 0;}
 
int main()
{FILE *f=fopen("sate.in","r"),*g=fopen("sate.out","w");
fscanf(f,"%d%d%d%d",&n,&m,&x,&y),c[x]=1;
while(m--)
      fscanf(f,"%d%d%d",&i,&j,&k),A(i,j,k),A(j,i,-k);
for(t=l[x];t;t=t->next)
if(t->info>x)
      s[u].a=x,s[u++].b=t->info;
else
      s[u].a=t->info,s[u++].b=x;
while(p<u)
      {i=s[p].a,j=s[p++].b;
      if(c[y])
             break;
      if(!c[i])
             o=i,c[i]=1;
      else
             {if(!c[j])
                    o=j,c[j]=1;}
      for(t=l[o];t;t=t->next)
             {k=t->info,e=B(i,j);
             if(!c[k])
                   {if(k<i)
                          if((q=B(k,i)))
                                 s[u].a=k,s[u++].b=j,A(k,j,e+q);
                          else
                                 s[u].a=k,s[u++].b=i,A(k,i,B(k,j)-e);             
                   else
                          if(k>i&&k<j)
                                 if((q=B(i,k)))
                                       s[u].a=k,s[u++].b=j,A(k,j,e-q);
                                 else
                                       s[u].a=i,s[u++].b=k,A(i,k,e-B(k,j));
                          else
                                 if(k>j)
                                       if((q=B(j,k)))
                                              s[u].a=i,s[u++].b=k,A(i,k,e+q);
                                       else
                                              s[u].a=j,s[u++].b=k,A(j,k,B(i,k)-e);}}}
fprintf(g,"%d",B(x,y));
return 0;}