#include <bits/stdc++.h>
#define NMAX 30005
using namespace std;

ifstream f("sate.in");
ofstream g("sate.out");

vector < pair < int, int > > nod[NMAX];
queue < int > q;

int n, m, x, y, D, start, stop, ans, drum[NMAX];
bool visited[NMAX];

void citire(){
    f>>n>>m>>start>>stop;
    for(int i = 1; i <= m; ++i){
        f>>x>>y>>D;
        nod[x].push_back(make_pair(y, D));
        nod[y].push_back(make_pair(x, -D));
    }
}

void bfs(){
    q.push(start);
    visited[start] = 1;
    while(!q.empty()){
        int node = q.front();
        q.pop();
        for(int j = 0; j < nod[node].size(); ++j){
            if(!visited[nod[node][j].first]){
                ans += nod[node][j].second;
                visited[nod[node][j].first] = 1;
                q.push(nod[node][j].first);
            }
        }

    }

}

int main()
{
    citire();
    bfs();
    g<<ans;
    return 0;
}