#include<bits/stdc++.h>
using namespace std;
int n,m,x,y,z,o1,o2;
long long rs[30005];
vector< pair<int,int> > v[30005];bool viz[30005];
queue<int> q;
void bfs(int nod){
    q.push(nod);
    viz[nod]=1;
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        for(int i=0;i<v[nod].size();i++)
        if(!viz[v[nod][i].first]){
            q.push(v[nod][i].first);
            rs[v[nod][i].first]+=rs[nod]+v[nod][i].second;
            viz[v[nod][i].first]=1;
            if(v[nod][i].first==o2)return;
        }
    }
}
int main(){
    ifstream cin("sate.in");
    ofstream cout("sate.out");
    scanf("%d",&n);
    scanf("%d",&m);
    scanf("%d",&o1);
    scanf("%d",&o2);
    for(int i=1;i<=m;i++){
        scanf("%d",&x);
        scanf("%d",&y);
        scanf("%d",&z);
        v[y].push_back(make_pair(x,-z));
        v[x].push_back(make_pair(y,z));
    }
    bfs(o1);
    printf("%d",rs[o2]);
    return 0;
}