#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;

const int MAXN=1e5+5;
const int INF=1e9+5;
int bl=300;

int n;
vector<int> adj[MAXN];
int par[MAXN][20];
int depth[MAXN];
long long c[MAXN];
unordered_map<long long,vector<int> > m;
int mn=INF, mx=0;
long long clr;
int dp[MAXN][2];

void chMin(int &mn1,int &mn2,int val)
{
    if(val<mn1)
    {
        mn2=mn1;
        mn1=val;
    }
    else if(val<mn2) mn2=val;
}

void chMax(int &mx1,int &mx2,int val)
{
    if(val>mx1)
    {
        mx2=mx1;
        mx1=val;
    }
    else if(val>mx2) mx2=val;
}

void dfs(int v)
{
    if(adj[v].size()==0)
    {
        if(c[v]==clr) dp[v][0]=dp[v][1]=0;
        else dp[v][0]=INF, dp[v][1]=-INF;
        return;
    }
    int mn1,mn2,mx1,mx2;
    mn1=mn2=INF;
    mx1=mx2=-INF;
    for(int i=0;i<adj[v].size();i++)
    {
        if(adj[v][i]==par[v][0]) continue;
        dfs(adj[v][i]);
        chMin(mn1,mn2,dp[adj[v][i]][0]);
        chMax(mx1,mx2,dp[adj[v][i]][1]);
    }
    if(c[v]==clr)
    {
        dp[v][0]=0;
        dp[v][1]=max(0,mx1+1);
        mn=min(mn, mn1+1);
        chMax(mx1,mx2,-1);
        mx=max(mx,mx1+1+mx2+1);
    }
    else
    {
        dp[v][0]=mn1+1;
        dp[v][1]=mx1+1;
        mn=min(mn, mn1+1+mn2+1);
        mx=max(mx, mx1+1+mx2+1);
    }//cout<<v<<" "<<dp[v][0]<<" "<<dp[v][1]<<" "<<mn1<<" "<<mn2<<" "<<mx1<<" "<<mx2<<endl;
}

void chDP(int cur)
{//cout<<cur<<endl;

    clr=cur;
    dfs(1);//cout<<"=========="<<endl;
}

int lca(int u,int v)
{
    if(depth[u]<depth[v]) swap(u,v);
    for(int j=17;j>=0;j--)
    {
        if(depth[u]-depth[v]>=(1<<j)) u=par[u][j];
    }
    if(u==v) return u;
    for(int j=17;j>=0;j--)
    {
        if(par[u][j]!=par[v][j])
        {
            u=par[u][j];
            v=par[v][j];
        }
    }
    return par[u][0];
}

void chLCA(int cur)
{
    for(int i=1;i<m[cur].size();i++)
    {
        for(int j=0;j<i;j++)
        {
            int u=lca(m[cur][i],m[cur][j]);
            int tmp=depth[m[cur][i]]+depth[m[cur][j]]-2*depth[u];
            mn=min(mn, tmp);
            mx=max(mx, tmp);
        }
    }
}

void dfs1(int v)
{
    for(int i=0;i<adj[v].size();i++)
    {
        int u=adj[v][i];
        if(u==par[v][0]) continue;
        depth[u]=depth[v]+1;
        par[u][0]=v;
        for(int j=1;(1<<j)<=depth[u];j++) par[u][j]=par[par[u][j-1]][j-1];
        dfs1(u);
    }
}

void precomp()
{
    par[1][0]=0;
    depth[1]=0;
    dfs1(1);
}

int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

freopen("colors.in","r",stdin);
freopen("colors.out","w",stdout);

cin>>n; //bl=sqrt(n);
for(int i=1;i<n;i++)
{
    int u,v;
    cin>>u>>v;
    adj[u].push_back(v);
    adj[v].push_back(u);
}
for(int i=1;i<=n;i++)
{
    cin>>c[i];
    m[c[i]].push_back(i);
}

precomp();

for(auto it=m.begin();it!=m.end();it++)
{
    int cur=(*it).first;
    int cnt=(*it).second.size();//cout<<cur<<" "<<cnt<<endl;
    if(cnt<2) continue;
    if(cnt>=bl)
    {
        chDP(cur);
    }
    else
    {
        chLCA(cur);
    }
}

if(mn==INF || mx==0) cout<<-1<<" "<<-1<<endl;
else cout<<mn<<" "<<mx<<endl;

return 0;
}