#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("sate.in");
ofstream fout("sate.out");

const int NMAX=30005;

vector<int> Ad[NMAX],Cost[NMAX];

int n,m,x,y;
int vis[NMAX];
int total;

void Read()
{
    int i,j,a,b,c;
    fin>>n>>m>>x>>y;
    for(i=1; i<=m; ++i)
    {
        fin>>a>>b>>c;
        Ad[a].push_back(b);
        Ad[b].push_back(a);
        Cost[a].push_back(c);
        Cost[b].push_back(c);
    }
}

bool found=false;

void DFS(int x)
{
    int i,w;
    vis[x]=1;
    for(i=0; i<Ad[x].size() && found==false; ++i)
        if(!vis[Ad[x][i]])
        {
            w=Ad[x][i];
            if(w>x)
                total+=Cost[x][i];
            else total-=Cost[x][i];
            if(w!=y)
                DFS(w);
            else found=true;
        }
}

void Do()
{
    int i,j;
    DFS(x);
    fout<<total;
}

int main()
{
    Read();
    Do();
    return 0;
}