#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 30005
using namespace std;
ifstream fin("sate.in");
ofstream fout("sate.out");
 
int n, m, x, y, sum, dist[NMAX];
vector< pair<int, int> > gr[NMAX];
queue<int> q;
 
void citire() {
  fin >> n >> m >> x >> y;
  for (int i = 1; i <= m; i++) {
    int a, b, cost;
    fin >> a >> b >> cost;
    gr[a].push_back(make_pair(b, cost));
    gr[b].push_back(make_pair(a, -1 * cost));
  }
}
 
void BFS(int n_start, int n_end) {
  q.push(n_start);
  while (!q.empty()) {
    int nodC = q.front();
    q.pop();
    for (int i = 0; i < gr[nodC].size(); i++) {
      int comp = gr[nodC][i].first;
      int val = gr[nodC][i].second;
      if (!dist[comp]) {
        dist[comp] = dist[nodC] + val;
        q.push(comp);
        if (comp == n_end) {
          fout << dist[n_end];
          return;
        }
      }
    }
  }
}
 
int main(int argc, const char * argv[]) {
  citire();
  BFS(x, y);
}