#include <fstream>
#include <iostream>
#include <list>
#include <cstring>

using namespace std;

list<pair<int,int> >G[250010];
int n,m,x,y,c,i,j,ls,ld,mij,a,b,viz[250010],ans;

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

void DF( int nod )
{
    viz[ nod ] = 1;
    for( list<pair<int,int> >::iterator it = G[ nod ].begin() ; it != G[ nod ].end() ; it++ )
    {
        //cout<<(*it).first<<' '<<(*it).second<<'\n';
        if( viz[ (*it).first ] == 0 && (*it).second <= mij )
            DF( (*it).first );
    }
}

int main()
{
    fin>>n>>m>>a>>b;
    for( i = 1 ; i <= m ; i++ )
    {
        fin>>x>>y>>c;
        G[ x ].push_back( { y , c } );
    }
    ls = 1;
    ld = 1000;
    while( ls <= ld )
    {
        mij = ( ls + ld ) / 2;
        memset( viz , 0 , sizeof( viz ) );
        DF( a );
        if( ls == ld )
        {
            if( viz[ b ] == 1 )
                fout<<min(ans,mij);
            else
                fout<<ans;
            return 0;
        }
        if( viz[ b ] == 1 )
            ld = mij - 1,ans = mij;
        else
            ls = mij + 1;
    }
    fout<<ans;

return 0;
}