时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
Given a connected graph with 
nodes indexed from 
to and 
undirected edges. The nodes with index 
has a value 
. We call a path beautiful if and only if all nodes in it are distinct and the values of the nodes are strictly rise from one end to the other.
Find the length of the longest beautiful path, and print it out.
Find the length of the longest beautiful path, and print it out.
输入描述:
The first line contains a positive integer, indicates the number of the vertices.
Each of the nextlines contains two integers
, representing an edge between
and
.
The next line contains— the array
.
输出描述:
The only line contains ONE integer indicates the length of the longest beautiful path.