#include <iostream>
#include <stdio.h>
#include <vector>

#define nr 30010

using namespace std;

struct S{
    int nod;
    int cost;
};

vector <S> a[nr];
int c[nr],s[nr],g[nr];
int start,n,m,end;


void BFS(int nod)
{
    int i,j,l;
    for (i=1; i<=n; i++) c[i]=-1;
    l=1;
    c[nod]=0;
    s[l]=nod;
    for (i = 1; i <= l; i++)
    for (j = 0; j < g[s[i]]; j++)
    {
       if (c[a[s[i]][j].nod] == -1)
       {
           s[++l] = a[s[i]][j].nod;
           c[s[l]] = c[s[i]] + a[s[i]][j].cost;
       }
       if ( c[end]!=-1) break;
    }
    printf("%i",c[end]);
}

int main()
{
	freopen("sate.in", "r", stdin);
	freopen("sate.out", "w", stdout);
	int i,x,y,c;
    scanf("%i%i%i%i",&n,&m,&start,&end);
    for (i=1; i<=m; i++)
    {
        scanf("%i%i%i",&x,&y,&c);
        a[x].push_back((S) {y,c}  );
        a[y].push_back((S) {x,-c} );
    }
    for (i=1; i<=n; i++) g[i]=a[i].size();
    BFS(start);
    return 0;
}