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

int n,m,x,y,mx,sol;
short ap[250100];
vector< pair<int,short> > A[250100];
vector<int> v[1010];
queue<int> Q;

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

    int x1,y1,c;
    in>>n>>m>>x>>y;
    for(int i=1;i<=m;++i)
    {
        in>>x1>>y1>>c;
        if(mx<c)
        {
            mx=c;
        }
        A[x1].push_back(make_pair(y1,c));
    }

    Q.push(x);
    v[0].push_back(x);

    for(int i=0;i<=mx;++i)
    {
        for(int it=0;it<v[i].size();++it)
        {
            int nod=v[i][it];
            if(nod==y)
            {
                out<<i<<'\n';
                return 0;
            }

            if(!ap[nod])
            {
                ap[nod]=1;
                for(vector< pair<int,short> >::iterator it2=A[nod].begin();it2!=A[nod].end();++it2)
                {
                    int cost=max((short)i,it2->second);
                    v[cost].push_back(it2->first);
                }
            }
        }
    }

    out.close();
    return 0;
}