#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define int128 __int128
#define FOR(i, m, n) for(int i=(m);i<=(n);i++)
#define ROF(i, m, n) for(int i=(m);i>=(n);i--)
#define REP(i, n) for(int i=0;i<(n);i++)
#define BG(v) v.begin()
#define ED(v) v.end()
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) v.size()
#define FI(v) v.first
#define SE(v) v.second
#define func(v) function<v>
#define pb push_back
#define eb emplace_back
#define DFS func(void(int, int))
#define PII pair<int,int>
#define PLL pair<ll, ll> 
#define endl '\n'
const int INF = 1e9 + 7;
const ll LNF = 1e18 + 7;
const double EPS = 1e-8;
const int P = 998244353;
const int G = 3;
const int GI = 332748118;
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
void IOSinit() {
	ios :: sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
}
int fp(int x,int y) {
	int res = 1;
	for(;y;y >>= 1) {
		if(y & 1) res = (1ll * res * x) % P;
		x = (1ll * x * x) % P;
	}
	return res;
}
const int N = 1e5 + 5;
int I, n, k, m;
struct Stf {
	int u, v;
	Stf() {
		u = 0, v = INF;
	}
	bool operator < (const Stf &A) const {
		return v < A.v;
	}
	bool operator > (const Stf &A) const {
		return v > A.v;
	}
} a[N << 1]; 
int fi[N], ne[N], to[N], ecnt;
int fa[N], sz[N], dfn[N], rnk[N], son[N], top[N], dnt;
int lst[N << 1];
ll ans[N];
void add(int u, int v) {
	ne[++ecnt] = fi[u];
	to[ecnt] = v;
	fi[u] = ecnt;
}
void dfs1(int u) {
	sz[u] = 1;
	son[u] = -1;
	for(int i = fi[u]; i; i = ne[i]) {
		int v = to[i];
		dfs1(v);
		sz[u] += sz[v];
		if(son[u] == -1 || sz[v] >= sz[son[u]]) son[u] = v;
	}
}
void dfs2(int u, int tp) {
	top[u] = tp;
	dfn[u] = ++dnt;
	rnk[dnt] = u;
	if(son[u] != -1) dfs2(son[u], tp);
	for(int i = fi[u]; i; i = ne[i]) {
		int v = to[i];
		if(v != son[u]) dfs2(v, v);
	}
}
namespace SgT_I {
	struct Node {
		int x;
		Node(int _x = 0) {
			x = _x;
		}
		bool operator < (const Node &A) const {
			if(a[x].v != a[A.x].v) return a[x] < a[A.x];
			return x < A.x;
		}
	};
	set<Node> S[N]; 
	int F[N << 2];
	void pushup(int u) {
		if(a[F[u << 1]] < a[F[u << 1 | 1]]) F[u] = F[u << 1];
		else F[u] = F[u << 1 | 1];
	}
	void modify(int u, int l, int r, int p, int x) {
		if(l == r) {
			F[u] = x;
			return;
		}
		int mid = l + r >> 1;
		if(p <= mid) modify(u << 1, l, mid, p, x);
		else modify(u << 1 | 1, mid + 1, r, p, x);
		pushup(u);
	}
	int query(int u, int l, int r, int ql, int qr) {
		if(ql <= l && r <= qr) {
			return F[u];
		}
		int mid = l + r >> 1;
		if(qr <= mid) return query(u << 1, l, mid, ql, qr);
		if(ql > mid) return query(u << 1 | 1, mid + 1, r, ql, qr);
		int vl = query(u << 1, l, mid, ql, qr);
		int vr = query(u << 1 | 1, mid + 1, r, ql, qr);
		if(a[vl] < a[vr]) return vl;
		return vr;
	}
	void insert(int i) {
		int u = a[i].u;
		S[u].insert(Node(i));
		modify(1, 1, n, dfn[u], (*S[u].begin()).x);
	}
	void del(int i) {
		int u = a[i].u;
		S[u].erase(Node(i));
		if(S[u].empty()) modify(1, 1, n, dfn[u], 0);
		else modify(1, 1, n, dfn[u], (*S[u].begin()).x);
	}
}
namespace SgT_M {
	int F[N << 2], T[N << 2];
	void pushup(int u) {
		F[u] = min(F[u << 1], F[u << 1 | 1]);
	}
	void push(int u, int x) {
		F[u] += x;
		T[u] += x;
	}
	void pushdown(int u) {
		if(T[u]) {
			push(u << 1, T[u]);
			push(u << 1 | 1, T[u]);
			T[u] = 0;
		}
	}
	void build(int u, int l, int r) {
		if(l == r) {
			F[u] = sz[rnk[l]];
			return;
		}
		int mid = l + r >> 1;
		build(u << 1, l, mid);
		build(u << 1 | 1, mid + 1, r);
		pushup(u); 
	}
	void modify(int u, int l, int r, int ql, int qr, int x) {
		if(ql <= l && r <= qr) {
			push(u, x);
			return;
		}
		pushdown(u);
		int mid = l + r >> 1;
		if(ql <= mid) modify(u << 1, l, mid, ql, qr, x);
		if(mid < qr) modify(u << 1 | 1, mid + 1, r, ql, qr, x);
		pushup(u);
	}
	int query_m(int u, int l, int r, int ql, int qr) {
		if(ql <= l && r <= qr) {
			return F[u];
		}
		pushdown(u);
		int mid = l + r >> 1;
		if(qr <= mid) return query_m(u << 1, l, mid, ql, qr);
		if(ql > mid) return query_m(u << 1 | 1, mid + 1, r, ql, qr);
		return min(query_m(u << 1, l, mid, ql, qr), query_m(u << 1 | 1, mid + 1, r, ql, qr));
	}
	int query_p(int u, int l, int r, int ql, int qr) {
		if(ql <= l && r <= qr) {
			if(F[u] > 0) return 0;
			while(l < r) {
				int mid = l + r >> 1;
				pushdown(u);
				if(!F[u << 1 | 1]) {
					u = u << 1 | 1;
					l = mid + 1;
				}
				else {
					u = u << 1;
					r = mid;
				}
			}
			return rnk[l];
		}
		pushdown(u);
		int mid = l + r >> 1;
		if(qr <= mid) return query_p(u << 1, l, mid, ql, qr);
		if(ql > mid) return query_p(u << 1 | 1, mid + 1, r, ql, qr);
		int val = query_p(u << 1 | 1, mid + 1, r, ql, qr);
		if(val) return val;
		return query_p(u << 1, l, mid, ql, qr);
	}
}
namespace SgT_T {
	void build() {
		SgT_M :: build(1, 1, n);
	}
	void modify(int u, int x) {
		while(u) {
			int v = top[u];
			SgT_M :: modify(1, 1, n, dfn[v], dfn[u], x);
			u = fa[v];
		}
	}
	int query(int u) {
		while(u) {
			int v = top[u];
			if(SgT_M :: query_m(1, 1, n, dfn[v], dfn[u]) > 0) {
				u = fa[v];
				continue;
			}
			return SgT_M :: query_p(1, 1, n, dfn[v], dfn[u]);
		}
		return 0;
	}
}
namespace Main {
	struct Node {
		int u, v;
	} stk[N << 1]; int tp;
	ll ans;
	void insert(int u) {
		ans += a[u].v;
		SgT_I :: insert(u);
		SgT_T :: modify(a[u].u, -1);
	}
	void del(int u) {
		ans -= a[u].v;
		SgT_I :: del(u);
		SgT_T :: modify(a[u].u, 1);
	}
	bool check(int u) {
		int p = SgT_T :: query(a[u].u);
		if(!p) {
			tp++;
			stk[tp].u = u;
			stk[tp].v = 0;
			insert(u);
			return 1;
		}
		int lst = SgT_I :: query(1, 1, n, dfn[p], dfn[p] + sz[p] - 1);
		if(a[lst] < a[u]) {
			tp++;
			stk[tp].u = u;
			stk[tp].v = lst;
			insert(u);
			del(lst);
			return 1;
		}
		return 0;
	}
	void roll() {
		int u = stk[tp].u;
		int v = stk[tp].v;
		tp--;
		del(u);
		if(v) insert(v);
	}
}
namespace SgT_B {
	vector<int> e[N << 2];
	void modify(int u, int l, int r, int ql, int qr, int x) {
		if(ql <= l && r <= qr) {
			e[u].pb(x);
			return;
		}
		int mid = l + r >> 1;
		if(ql <= mid) modify(u << 1, l, mid, ql, qr, x);
		if(mid < qr) modify(u << 1 | 1, mid + 1, r, ql, qr, x);
	} 
	void dfs(int u, int l, int r) {
		int tp = 0;
		for(int i : e[u]) tp += Main :: check(i);
		int mid = l + r >> 1;
		if(l == r) ans[l] = Main :: ans;
		else dfs(u << 1, l, mid), dfs(u << 1 | 1, mid + 1, r); 
		while(tp--) Main :: roll();
	}
}
void solve() {
	cin >> I >> n >> k >> m;
	FOR(i, 2, n) {
		cin >> fa[i];
		add(fa[i], i);
	}
	dfs1(1);
	dfs2(1, 1);
	SgT_T :: build();
	FOR(i, 1, k) cin >> a[i].u >> a[i].v;
	FOR(i, 1, m) {
		int opt;
		cin >> opt;
		if(opt == 1) {
			int u, v;
			cin >> u >> v;
			a[++k].u = u;
			lst[k] = i;
			a[k].v = v;
		}
		else {
			int u;
			cin >> u;
			SgT_B :: modify(1, 0, m, lst[u], i - 1, u);
			lst[u] = -1; 
		}
	} 
	FOR(i, 1, k) if(lst[i] > -1) {
		SgT_B :: modify(1, 0, m, lst[i], m, i);
	}
	SgT_B :: dfs(1, 0, m);
	FOR(i, 0, m) {
		cout << ans[i] << " ";
	}
	cout << endl;
}
int main() {
	// freopen("transfer/transfer3.in", "r", stdin);
	// freopen("transfer.out","w",stdout);
	IOSinit();
	solve();
	return 0;
}