#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
using namespace std;

int n, maxn;
vector<int> start, depth, en, BIT, discover;
vector<vector<int> > graph, T;

void dfs(int node, int len, int par)
{
	start[node] = int(discover.size());
	discover.push_back(node);
	depth[node] = len+1;
	T[node][0] = par;
	for(vector<int>::iterator it = graph[node].begin();it != graph[node].end();it++) dfs(*it, len+1, node);
	en[node] = int(discover.size())-1;
}

void upd(int idx, int v)
{
	while(idx < int(BIT.size()))
	{
		BIT[idx] += v;
		idx += (idx&-idx);
	}
}

int qry(int idx)
{
	int res = 0;
	while(idx > 0)
	{
		res += BIT[idx];
		idx -= (idx&-idx);
		//cout << idx << "n";
	}
	return res;
}

void init()
{
	for(int j = 1;j <= maxn;j++)
	{
		for(int i = 0;i < n;i++)
		{
			if(T[i][j-1] != -1)
			{
				T[i][j] = T[T[i][j-1]][j-1];
				//cout << i << " " << j << " " << T[i][j] << "n";
			}
		}
	}
}

int LCA(int x, int y)
{
	//cout << x << " " << y << "n";
	if(depth[x] > depth[y]) swap(x, y);
	//cout << x << " " << y << "n";
	for(int j = maxn;j >= 0;j--)
	{
		if(depth[y]-(1<<j) >= depth[x])
		{
			//cout << y << "n";
			y = T[y][j];
		}
	}

	if(x == y) return x;

	for(int j = maxn;j >= 0;j--)
	{
		if(T[x][j] != T[y][j])
		{
			x = T[x][j];
			y = T[y][j];
		}
	}
	return T[x][0];
}

int main(void)
{
	int u, q, type, a, b, v;
	scanf("%d", &n);
	graph.clear(); graph.resize(n);
	maxn = int(log2(n))+1;
	T.clear(); T.resize(n+2, vector<int>(maxn+2, -1));
	start.clear(); start.resize(n);
	depth.clear(); depth.resize(n);
	en.clear(); en.resize(n);
	discover.clear(); discover.push_back(-1);
	for(int i = 1;i < n;i++)
	{
		scanf("%d", &u);
		u--;
		graph[u].push_back(i);
	}

	dfs(0, 0, -1);
	BIT.clear(); BIT.resize(int(discover.size())+2);
	init();
	for(int i = 0;i < n;i++)
	{
		if(start[i] == en[i]) continue;
		upd(start[i]+1, 1);
		upd(en[i]+1, -1);
		//cout << start[i] << " " << en[i] << "n";
	}
	//for(int i = 0;i < n;i++) cout << qry(start[i]) << "n";

	scanf("%d", &q);
	vector<int> del(n+1);
	while(q--)
	{
		scanf("%d", &type);
		if(type == 1)
		{
			scanf("%d%d", &a, &b);
			a--; b--;
			if(a == b)
			{
				printf("0n");
				continue;
			}
			//cout << start[a] << " " << start[b] << "n";
			int res = qry(start[a])+qry(start[b]);
			//cout << res << " " << "n";
			//cout << LCA(a, b) << "n";
			res -= 2*qry(start[LCA(a, b)]);
			if(T[a][0] == T[b][0] && del[T[b][0]] && T[a][0] != -1) res += 2;
			printf("%dn", res);
		}
		else
		{
			scanf("%d", &v);
			v--;
			if(start[v] == en[v]) continue;
			upd(start[v]+1, -1);
			upd(en[v]+1, 1);
			del[v] = 1;
		}
	}
}