#include <cstdio>
#include <vector>
#include <cstring>

using namespace std;

const int N = 250005;

vector <pair <int, int> > L[N];

int n, sup, S, D;

bool used[N];

void read() {
  int m, x, y, p;

  scanf("%d%d%d%d", &n, &m, &S, &D);

  for (int i = 1; i <= m; ++i) {
    scanf("%d%d%d", &x, &y, &p);

    L[x].push_back(make_pair(y, p));
  }
}

void df(int nod) {
  used[nod] = 1;

  for (int j = 0; j < (int)L[nod].size() && !used[D]; ++j)
    if (!used[L[nod][j].first] && L[nod][j].second <= sup)
      df(L[nod][j].first);
}

bool valid(int x) {
  sup = x;

  for (int i = 1; i <= n; ++i)
    used[i] = 0;

  df(S);

  return used[D];
}

int cautb() {
  int i = 0, pas = 1 << 10;

  for (i = 0; pas; pas >>= 1)
    if (!valid(i + pas))
      i += pas;

  return i + 1;
}

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

  read();

  printf("%d", cautb());

  return 0;
}