/// calculez pentru fiecare nod inaltimea maxima si a doua inaltime maxima
/// in functie de prima inaltime maxima a fiilor

#include <fstream>

using namespace std;

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

void dfs(int nod, int tata){
    for(int i = 0;i<v[nod].size();i++){
        int crt = v[nod][i].first;
        if(crt != tata){
            dfs(crt, nod);
            if(a1[crt] > a1[nod])
                a2[nod] = a1[nod], a1[nod] = a1[crt];
            else
                if(a1[crt] == a1[nod])
                    a2[nod] = a1[crt];
        }
    }
}

int main(){
    fin>>n>>rad;
    for(i=1;i<=n;i++){
        fin>>a>>b>>c;
        v[a].push_back(make_pair(b, c));
        v[b].push_back(make_pair(a, c));
    }
    dfs(rad, 0);
    return 0;
}