#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;


int main()
{
	ifstream cin("pscnv.in");
	ofstream cout("pscnv.out");
	int n, m, x, y;
	vector <vector< pair<int,int> > > graph;
	queue<int> q;
	vector<bool> visited;
	cin >> n >> m >> x >> y;
	x--;
	y--;
	graph.resize(n);
	visited.resize(n);
	for (int a, b, c; m; m--) {
		cin >> a >> b >> c;
		a--;
		b--;
		graph[a].push_back({ b, c });
	}


	int l = 1, r = 1000;
	while (l <= r) {
		int mid = (l + r) / 2;
		fill(visited.begin(), visited.end(),false);
		visited[x] = true;
		q.push(x);
		while (!q.empty()) {
			int v = q.front();
			q.pop();
			for (const auto& w : graph[v]) {
				if (w.second <= mid && !visited[w.first]) {
					visited[w.first] = true;
					q.push(w.first);
				}
			}
		}

		if (visited[y]) {
			r = mid - 1;
		} else {
			l = mid + 1;
		}
	}

	cout << l;
	return 0;
}