#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
const int N=1e5;
vector<int>v[N];
int lvl[N];
int col[N];
int cnt[N][3];
int par[N];
vector<pair<int,int>>vc[N];
pair<int,int>ans;
void df(int a ){
cnt[lvl[a]][col[a]]++;
for(auto b:v[a]){
lvl[b]=lvl[a]+1;
df(b);
}
}
void dfs(int a ){
map<int,int>mp,pm;
vc[a].pb({lvl[a],col[a]});
for(auto b:v[a]){
dfs(b);
if(vc[b].size()>vc[a].size()){
swap(vc[b],vc[a]);
}
for(auto p:vc[b]){
vc[a].pb(p);
if(p.ss==col[a])mp[p.ff]++;
else pm[p.ff]++;
}
}
pair<int,int>t={0,0};
int c=col[a];
for(auto it=pm.begin();it!=pm.end();it++){
int i= it->ff;
t.ff+= min(pm[i],(cnt[i][c]-mp[i]));
t.ss -= min(pm[i],(cnt[i][c]-mp[i]));
if(mp[i]==0)mp.erase(mp.find(i));
}
for(auto it=mp.begin();it!=mp.end();it++){
t.ff+=it->ss;
}
ans=max(ans,t);
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>n>>k;
int mx=0;
for(int i=0;i<n;i++){
cin>>col[i];
}
for(int i=1;i<n;i++){
cin>>par[i];
v[par[i]].pb(i);
}
df(0);
dfs(0);
cout<<ans.ff<<" "<<-ans.ss<<endl;
}
