#include <iostream>
#include <bits/stdc++.h>
#define NMAX 200005
using namespace std;
ifstream f("guvern.in");
ofstream g("guvern.out");
class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;
	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}
public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}
	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
int val[NMAX];
struct interv{int x,st,dr;};
interv ev[NMAX];
bool cmp(interv a,interv b)
{
    return a.dr<b.dr;
}
struct cmpset
{
    bool operator()(const int &node1,const int&node2)
    {
        return val[node1]<val[node2];
    }
};
set<pair<int,int> > s;
set<pair<int,int> > :: iterator it;
vector<int> gr[NMAX];
int n,nxt[NMAX],cnt=0;
int dp[NMAX];
vector<int> ant[NMAX];
int aux[NMAX],lft[NMAX],rght[NMAX];
void dfs(int nod,int dad)
{

    cnt++;
    lft[nod]=cnt;
    it=s.lower_bound({val[nod],0});
    if(it==s.end()) nxt[nod]=0;
    else nxt[nod]=it->second;
    s.insert({val[nod],nod});
    for(int i=0;i<gr[nod].size();i++)
    {
        if(gr[nod][i]!=dad)
            dfs(gr[nod][i],nod);
    }
    s.erase({val[nod],nod});
    ant[nxt[nod]].push_back(nod);
    rght[nod]=cnt;

}


void dfs2(int node,int dad)
{
    for(int i=0;i<gr[node].size();i++)
    {
        if(gr[node][i]!=dad)
        {
            dfs2(gr[node][i],node);
        }
    }
    int nr=0;
    for(int i=0;i<ant[node].size();i++)
    {
        int vec=ant[node][i];
        ev[++nr].x=dp[vec];
        ev[nr].st=lft[vec];
        ev[nr].dr=rght[vec];
    }
    sort(ev+1,ev+nr+1,cmp);
    for(int i=1;i<=nr;i++)
    {
        int st=1,dr=i-1,rasp=0;
        aux[i]=aux[i-1];
        while(st<=dr)
        {
            int mij=(st+dr)/2;
            if(ev[mij].dr<ev[i].st)
            {
                rasp=mij;
                st=mij+1;
            }
            else dr=mij-1;
        }

            aux[i]=max(aux[i],aux[rasp]+ev[i].x);


    }
    dp[node]+=aux[nr];

}
int main()
{
 InParser f("guvern.in");
ofstream g("guvern.out");
    f>>n;
    for(int i=1;i<n;i++)
    {
        int x,y;
        f>>x>>y;
        gr[x].push_back(y);
        gr[y].push_back(x);
    }
    gr[0].push_back(1);
    for(int i=1;i<=n;i++){
        f>>val[i];
        dp[i]=1;
    }
    dfs(1,0);
    dfs2(0,0);
    int sol=0;
    for(int i=0;i<=n;i++) sol=max(sol,dp[i]);
    g<<sol;








}