#include <cstdio>
#include <vector>
#include <queue>

#define INF 100000
#define NMAX 250005
#define max(a,b) a>b?a:b

using namespace std;

int best[NMAX];
int n,m,x,y,z,nod1,nod2;

priority_queue <pair <int,int > >q;
vector <pair <int ,int > >v[NMAX];
vector <pair <int ,int > >::iterator it;

int main()
{
    freopen("pscnv.in","r",stdin);
    freopen("pscnv.out","w",stdout);

    scanf("%d %d %d %d",&n,&m,&nod1,&nod2);

    for (int i=1;i<=n;i++)best[i]=INF;
    for (int i=1;i<=m;i++)
     {
        scanf("%d %d %d",&x,&y,&z);
        v[x].push_back(make_pair(y,z));
     }
    best[nod1]=0;
    q.push(make_pair(0,nod1));
    while (q.size())
     {
          int nod=q.top().second;
          q.pop();

          for (it=v[nod].begin();it!=v[nod].end();it++)
            if (max(best[nod],(*it).second)<best[(*it).first])
             {
                 q.push(make_pair(-max(best[nod],(*it).second),(*it).first));
                 best[(*it).first]=max(best[nod],(*it).second);
             }
     }
    printf("%d",best[nod2]);

    fclose(stdin);
    fclose(stdout);
}