#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

#define MAX 250001
#define INF 1001
struct muchie
{
    int x, c;
};

vector<muchie> g[MAX];
vector<int> lists[INF];
int dp[MAX];
int n, m, source, destination;

int Dijkstra()
{
    for(int i = 1; i <= n; i++)
        dp[i] = INF;

    dp[source] = 0;
    lists[0].push_back(source);

    for(int i = 0; i < INF; i++)
        for(size_t j = 0; j < lists[i].size(); j++)
        {
            int node = lists[i][j];
            if(dp[node] < i)
                continue;
            if(node == destination)
                return i;
            for(int k = 0; k < g[node].size(); k++)
            {
                int sol = max(dp[node], g[node][k].c);
                if(dp[g[node][k].x] <= sol)
                    continue;
                dp[g[node][k].x] = sol;
                lists[sol].push_back(g[node][k].x);
            }
        }
    return INF;
}

int main()
{
    ifstream fin("pscnv.in");
    ofstream fout("pscnv.out");


    fin >> n >> m >> source >> destination;

    for(int i = 1; i <= m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        g[x].push_back({y, c});
    }

    fout << Dijkstra() << '\n';

    return 0;
}