#include <bits/stdc++.h>

using namespace std;


struct drum
{
    int nod,cost;
} varaux1,varaux2;

int seen [40001];
int n,x,y,cost;
vector<drum>v[100050];
void dfs ( int nod )
{
    if(nod==y)
    {
        cout<<cost;
        return;
    }
    seen[nod]=-1;
    for(int i=0; i<v[nod].size(); i++)
        if(seen[v[nod][i].nod]==0)
        {
            cost+=v[nod][i].cost;
            dfs(v[nod][i].nod);
            cost-=v[nod][i].cost;
        }
}


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

int main()
{
    int i,m,a,b,dist;
    fin>>n>>m>>x>>y;
    for(i=1; i<=m; i++)
    {
        fin>>a>>b>>dist;
        varaux1= {b,dist};
        varaux2= {a,-dist};
        v[a].push_back(varaux1);
        v[b].push_back(varaux2);
    }
    dfs(x);
    return 0;
}