#include<bits/stdc++.h>
using namespace std;
#define sp <<' '<<
#define se second
#define fi first
#define pb push_back
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define DEBUG(x) cout<<#x sp x<<endl
#define mid (l+r)/2
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
const int MAXN=2e3+5;
int n,k;
vi a;
int p[MAXN], dep[MAXN];
vi adj[MAXN];
int say[MAXN][MAXN];
int say2[MAXN][MAXN];
int cocuk[MAXN];
pii ans;
int f;
int der;
void dfs(int nd,int ata,int h){
if(f==0){
say[h][a[nd]]++;
dep[nd]=h;
der=max(der,h);
}
else if(f==1){
say2[dep[nd]][a[nd]]++;
cocuk[dep[nd]]++;
}
else{
say2[dep[nd]][a[nd]]--;
cocuk[dep[nd]]--;
}
for(auto kom:adj[nd]){
if(kom==ata) continue;
dfs(kom,nd,h+1);
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>n>>k;
a.resize(n+1);
FORE(i,1,n+1){
cin>>a[i];
a[i]++;
}
FORE(i,2,n+1){
cin>>p[i];
p[i]++;
adj[p[i]].pb(i);
}
dfs(1,-1,0);
FORE(i,1,n+1){
f=1;
dfs(i,-1,0);
int renk=a[i];
pii res={0,0};
FORE(j,dep[i],der+1){
int deg=min(say[j][renk]-say2[j][renk],cocuk[j]-say2[j][renk]);
res.fi+=deg;
res.se+=deg;
res.fi+=say2[j][renk];
}
if(ans.fi<res.fi) ans=res;
if(ans.fi==res.fi and ans.se>res.se) ans=res;
//cout<<"nd" sp i sp res.fi sp res.se<<endl;
f=2;
dfs(i,-1,0);
}
cout<<ans.fi sp ans.se<<endl;
}
