#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <stack>
using namespace std;
ifstream fin("sate.in");
ofstream fout("sate.out");
int n, m, x, y;
vector<pair<int, int> > nod[30001];
int dist[30001];
bitset<30001> haveDist, searched;

void readAndSet() {
    fin >> n >> m >> x >> y;
    for (int i = 1; i <= m; i++) {
        int a, b, cost;
        fin >> a >> b >> cost;
        nod[a].push_back(make_pair(b, cost));
        nod[b].push_back(make_pair(a, -cost));
    }
}



int findLeftNode(int i) {
    int minn = i;
    searched[i] = true;
    for (pair<int, int> way : nod[i])
        if (!searched[way.first])
            minn = min(minn, findLeftNode(way.first));
    return minn;
}

void genDistance() {
    int leftNode = findLeftNode(x);
    stack<int> s;
    s.push(leftNode);

    while (!s.empty()) {
        int i = s.top();
        s.pop();

        for (pair<int, int> way : nod[i])
            if (!haveDist[way.first]) {
                haveDist[way.first] = true;
                dist[way.first] = dist[i] + way.second;
                s.push(way.first);
            }
    }
}

int main() {
    readAndSet();
    genDistance();
    fout << dist[y] - dist[x];
    return 0;
}