/<> 17469

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <unordered_map>
#include <numeric>
#include <iomanip>
using namespace std;
#define pii pair<int , int>
#define ll long long
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
const long long dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const long long dl[2] = {1, -1};
const long long MOD = 1000000007;
const long long MAXN = 100005;

int N, Q;
vector<pii> q;
vector<int> ans;
int par[MAXN];
int color[MAXN];
int unionp[MAXN];
int sz[MAXN];

set<int> colors[MAXN];

void init(){
    for(int i = 1; i <= N; i++){
        unionp[i] = i;
        sz[i] = 1;
        colors[i].insert(color[i]);
    }
}

int Find(int x){
    if(x == unionp[x]){
        return x;
    }
    return unionp[x] = Find(unionp[x]);
}
void Union(int a, int b){
    a = Find(a);
    b = Find(b);
    if(a == b){
        return;
    }
    if(sz[a] > sz[b]){
        swap(a, b);
    }
    unionp[a] = b;
    colors[b].merge(colors[a]);
    sz[b] += sz[a];
}

int Color(int x){
    x = Find(x);
    return colors[x].size();
}

int main() {
    FAST;
    cin >> N >> Q;
    for(int i = 2; i <= N; i++){
        cin >> par[i];
    }
    for(int i = 1; i <= N; i++){
        cin >> color[i];
    }
    init();
    for(int x, y, i = 0; i < Q + N - 1; i++){
        cin >> x >> y;
        q.push_back({x, y});
    }
    reverse(q.begin(), q.end());
    for(auto x : q){
        if(x.first == 1){
            Union(x.second, par[x.second]);
        }
        else{
            ans.push_back(Color(x.second));
        }
    }
    reverse(ans.begin(), ans.end());
    for(auto x : ans){
        cout << x << "\n";
    }
}

/*
5 4
5
2
2
1
1
3
2
3
3
1 4
2 1
2 3
1 2
2 5
1 5
2 3
1 3
 */