#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

ifstream in("color.in");
ofstream out("colors.out");

struct Node
{
    int value;
    int n;
    vector<long long> neighbors;
    bool visited;

    Node(long long val) : value(val), visited(false) {}
};

int bfs(Node startNode, vector<Node>& graph)
{
    long long len = 0;
    queue<long long> nodeQueue;
    nodeQueue.push(startNode.n);

    while (!nodeQueue.empty())
    {
        long long currentNode = nodeQueue.front();
        nodeQueue.pop();

        if (!graph[currentNode].visited)
        {
            //cout<<currentNode<<" ";
            graph[currentNode].visited = true;
            for (long long neighbor : graph[currentNode].neighbors)
            {
                if (!graph[neighbor].visited)
                {
                    if(graph[neighbor].value==startNode.value)
                    {
                        return len+1;
                    }
                    nodeQueue.push(neighbor);
                }
            }
            ++len;
        }
        //cout<<"\n";
    }

    return -1;
}

int main()
{
    long long min_len=LONG_MAX;
    long long max_len=LONG_MIN;
    long long len;
    int n;
    in>>n;
    vector<Node> graph(n, 0);
    int num1, num2;

    for(int i = 0; i<n-1; ++i)
    {
        in>>num1>>num2;
        graph[num1-1].neighbors.push_back(num2-1);
        graph[num2-1].neighbors.push_back(num1-1);
    }

    for(int i = 0; i<n; ++i)
    {
        in>>num1;
        graph[i].value = num1;
    }

    for(int i = 0; i<n; ++i)
    {
        len = bfs(graph[i], graph);
        if(len>max_len)
        {
            max_len=len;
        }
        if(len<min_len)
        {
            min_len=len;
        }


        for(auto& i : graph)
        {
            i.visited=false;
        }

    }

    out<<min_len<<" "<<max_len<<"\n";


    return 0;
}