program apm_campioni;
var     a:array[1..256,1..256] of integer;
        c,t,viz:array[1..256] of integer;
        n,k:integer;
        f,g:text;

procedure citire;
var i,j:integer;
begin
 readln(f,n);
 for k:=1 to n-1 do
 begin
        readln(f,i,j,a[i,j]);
        t[i]:=j;
 end;
 k:=0;
 while not eof(f) do
 begin
        k:=k+1;
        readln(f,c[k]);
 end;
end;

function pivot(st,dr:integer);
var i,j,di,dj,aux:integer;
begin
   i:=st; j:=dr;
   di:=0; dj:=1;
   while i<j do
   begin
        if c[i]>c[j] then
        begin
                aux:=c[i];
                c[i]:=c[j];
                c[j]:=aux;
                aux:=di;
                di:=dj;
                dj:=aux;
        end;
        i:=i+di;
        j:=j-dj;
   end;
   pivot:=i;
end;

procedure qsort(st,dr);
var p:integer;
begin
 if st<dr then
 begin
        p:=pivot(st,dr);
        qsort(st,p-1);
        qsort(p+1,dr);
 end;
end;

procedure adamea(x,y:intger);
var v1,v2:array[1..256] of integer;
     i,papa,fiu:integer;
begin
  papa:=t[i];
  v2[i]:=1;
  v1[i]:=0;
  fiu:=i;
  while papa<>0 do
    begin
      v2[papa]:=1;
      if v1[fiu]>a[fiu,papa] then
         v1[papa]:=v1[fiu]
           else
         v1[papa]:=a[fiu,papa];
      fiu:=papa;
      papa:=t[papa];
    end;
  papa:=t[j];
  v2[i]:=v2[i]+1;





end;


procedure apm;
var i,j,k:integer;
begin
 for i:=1 to n
        for j:=1 to n do
                if (a[i,j]=0)and(i<>j) then
                begin
                    if t[i]=t[j] then
                    begin
                      if a[i,t[j]]>a[j,t[j]] then
                        max:=a[i,t[j]]
                      else
                        max:=a[j,t[j]];
                    end
                    else
                    begin
                        max:=


begin
  assign(f,'apm.in'); reset(f);
  assign(g,'apm.out'); rewrite(g);
  citire;
  qsort(1,k);
  close(f); close(g);
end.