#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
int n,m,in,sf,x,y,k,i,v[250005];
vector <int> w[250005];
vector <int> l[250005];
queue <int> q;
int main()
{
    freopen("pscnv.in","r",stdin);
    freopen("pscnv.out","w",stdout);
    scanf("%d%d%d%d",&n,&m,&in,&sf);
    for(i=1; i<=n; i++)
    {
        v[i]=1005;
        w[i].push_back(0);
        l[i].push_back(0);
    }
    for(i=1; i<=m; i++)
    {
        scanf("%d%d%d",&x,&y,&k);
        w[x].push_back(y);
        w[x][0]++;
        l[x].push_back(k);

        w[y].push_back(x);
        w[y][0]++;
        l[y].push_back(k);
    }
    v[in]=0;
    q.push(in);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=1; i<=w[x][0]; i++)
        {
            y=w[x][i];
            if(v[y]>max(v[x],l[x][i]))
            {
                v[y]=max(v[x],l[x][i]);
                q.push(y);
            }
        }
    }
    printf("%d\n",v[sf]);
    return 0;
}