#include"bits/stdc++.h"
#include"ext/pb_ds/tree_policy.hpp"
#include"ext/pb_ds/assoc_container.hpp"
using namespace std;
using namespace __gnu_pbds;
#define FOR(i,a,b)for(int i=a;i<b;i++)
#define F0R(i,a)FOR(i,0,a)
#define ROF(i,a,b)for(int i=b-1;a<=i;i--)
#define R0F(i,a)ROF(i,0,a)
#define rep(a)F0R(_,a)
#define each(a,x)for(auto&a:x)
#define all(a)begin(a),end(a)
#define sz(x)int(size(x))
#define lla(x)rbegin(x),rend(x)
#define SUM(a)accumulate(all(a),0ll)
#define SUMM(a,b)accumulate(a,a+b,0ll)
#define MAX(a)*max_element(all(a))
#define MAXX(a,b)*max_element(a,a+b)
#define MIN(a)*min_element(all(a))
#define MINN(a,b)*min_element(a,a+b)
#define con const int
#define lwb lower_bound
#define upb upper_bound
#define bry binary_search
#ifdef LOCAL
#define print(x)cout<<x;
#else
#define print(...)
#endif
#define debug(x)print(#x<<" = "<<x<<endl)
using ld=long double;
using ll=long long;
using str=string;
template<class T>using oset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T>using omset=tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T>T minn(T a){return a;}
template<class T,class...Args>T minn(T a,Args... args){return min(a,minn(args...));}
template<class T>T maxx(T a){return a;}
template<class T,class...Args>T maxx(T a,Args... args){return max(a,maxx(args...));}
#define SMIN(a,b...)a=min(a,minn(b))
#define SMAX(a,b...)a=max(a,maxx(b))
void fileset(str a){assert(nullptr!=freopen((a+".in").c_str(),"r",stdin)&&nullptr!=freopen((a+".out").c_str(),"w",stdout));}
con mxN = 4e5 + 5;

vector<int> aj[mxN];

int dep[mxN];
int cnt[mxN];
int l[mxN];

int N;

int findDepth(int u, int d){
    int ans = INT_MAX;

    if (l[u] ^ l[0]){
        ans = d, cnt[d] ++;
    }

    dep[u] = d;

    each (v, aj[u]){
        ans = min(ans, findDepth(v, d + 1));
    }

    return ans;
}

vector<int> subtree(int u){
    vector<int> ans;

    F0R (i, sz(ans)){
        if (ans[i] < N){
            if (0 < i && dep[ans[i]] > dep[ans[i - 1]]){
                ans.push_back(N + dep[i]);
            }

            each (v, aj[i]){
                ans.push_back(v);
            }
        }
    }

    reverse(all(ans));

    return ans;
}

int main(){
    int K;
    cin >> N >> K;

    int ans = 0;

    F0R (i, N){
        cin >> l[i];

        if (l[0] == l[i]){
            ans ++;
        }
    }

    FOR (i, 1, N){
        int B;
        cin >> B;

        aj[B].push_back(i);
    }

    // find possible roots' depth

    int depth = findDepth(0, 0);

    // find possible roots

    vector<int> roots;

    F0R (i, N){
        if (dep[i] == depth && l[i] ^ l[0]){
            roots.push_back(i);
        }
    }

    // reverse dfs order with additional nodes for each possible root

    multiset<pair<int,int>> mt;

    each (r, roots){
        auto loc = subtree(r);

        int ans = 0;
        int swp = 0;

        int cap = 0;
        int neg = 0;

        each (u, loc){
            if (u < N){
                if (l[u] == l[0]) cap ++;
                else neg ++;
            } else {
                int dpt = u - N;

                swp += min(cap, cnt[dpt] - neg);
                ans += min(cap + neg, cnt[dpt]);

                cap = neg = 0;
            }
        }

        mt.emplace(-ans, swp);
    }

    // result
    auto [loc, swp] = *begin(mt);

    ans = min(-ans, loc);

    cout << -ans << ' ' << swp << endl;
}