#include <stdio.h>
#include <vector>

using namespace std;

vector <pair <int, int> > G[250500];
vector <int> dmin[1024];
int sol[250500];

inline int max(int A, int B)
{
	if (A > B)
		return A;
	return B;
}

void relax(int nod)
{
	vector <pair <int, int> > :: iterator it;
	
	for (it = G[nod].begin(); it != G[nod].end(); it ++)
		if (max(sol[nod], it -> second) < sol[it -> first])
		{
			sol[it -> first] = max(sol[nod], it -> second);
			dmin[max(sol[nod], it -> second)].push_back(it -> first);
		}
}

int main()
{
	int i, N, M, X, Y, maxC = 0;
	
	freopen("pscnv.in", "r", stdin);
	freopen("pscnv.out", "w", stdout);
	
	scanf("%d%d%d%d", &N, &M, &X, &Y);
	for (i = 1; i <= M; i ++)
	{
		int x0, y0, c;
		
		scanf("%d%d%d", &x0, &y0, &c);
		G[x0].push_back(make_pair(y0, c));
		if (c > maxC)
			maxC = c;
	}
	
	vector <int> :: iterator it;
	
	for (i = 1; i <= N; i ++)
		sol[i] = 1 << 30;
	sol[X] = 0; relax(X);
	
	for (i = 1; i <= maxC; i ++)
	{
		for (it = dmin[i].begin(); it != dmin[i].end(); it ++)
		{
			if (!(1 <= *it && *it <= N))
				continue;
			if (*it == Y)
			{
				printf("%d", sol[Y]);
				return 0;
			}
			if (sol[*it] == i)
				relax(*it);
		}
	}
	
	return 0;
}