#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
vi graph[2000001];
int pre[2000001];
int maxpre[2000001];
int cur_pre = 0;
multiset<pii> elms[2000001];
int dist[2000001];
void dfs(int v, int d = 0)
{
pre[v] = cur_pre++;
dist[v] = d;
forall(it,graph[v]) dfs(it,d+1);
maxpre[v] = cur_pre-1;
}
void add_elm(int v, int k)
{
elms[dist[v]].insert({pre[v],k});
}
void merge(int a, int b)
{
if(siz(elms[a]) < siz(elms[b])) swap(elms[a],elms[b]);
forall(it,elms[b]) elms[a].insert(it);
elms[b] = {};
}
int query(int v)
{
int sum = 0;
while(true)
{
auto it = elms[dist[v]].lower_bound({pre[v],-1});
if(it == elms[dist[v]].end() || (*it).ff > maxpre[v]) break;
sum += (*it).ss;
elms[dist[v]].erase(it);
}
if(sum != 0) elms[dist[v]].insert({pre[v],sum});
return sum;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n;
cin >> n;
rep2(i,2,n)
{
int p;
cin >> p;
graph[p].pb(i);
}
dfs(1);
rep2(i,1,n)
{
int k;
cin >> k;
add_elm(i,k);
}
int q;
cin >> q;
rep(qq,q)
{
int t;
cin >> t;
if(t == 1)
{
int a,b;
cin >> a >> b;
merge(b,a);
}
if(t == 2)
{
int a,b;
cin >> a >> b;
add_elm(a,b);
}
if(t == 3)
{
int x;
cin >> x;
cout << query(x) << "\n";
}
}
}
