#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int K = 40;
const int N = 50500;
int n;
int s[N];
int p[N];
int w[N];
int l[N];
int dp1[2][K][N];
ll dp2[2][K][N];
void init(int n, vector<int> S, vector<int> P, vector<int> W, vector<int> L) {
::n = n;
copy(S.begin(), S.end(), s);
copy(P.begin(), P.end(), p);
copy(W.begin(), W.end(), w);
copy(L.begin(), L.end(), l);
w[n] = l[n] = n;
for (int i = 0; i <= n; i++) {
dp1[0][0][i] = l[i];
dp1[1][0][i] = w[i];
dp2[0][0][i] = p[i];
dp2[1][0][i] = s[i];
}
for (int r = 0; r < 2; r++) {
for (int j = 1; j < K; j++) {
for (int i = 0; i <= n; i++) {
dp1[r][j][i] = dp1[r][j - 1][dp1[r][j - 1][i]];
dp2[r][j][i] = dp2[r][j - 1][i] + dp2[r][j - 1][dp1[r][j - 1][i]];
}
}
}
}
ll simulate(int i, int z) {
ll x = z;
for (int j = K - 1; ~j; --j) {
if (dp1[0][j][i] < n && x + dp2[0][j][i] < s[0]) {
x += dp2[0][j][i];
i = dp1[0][j][i];
}
}
if (x < s[0]) {
x += dp2[0][0][i];
i = dp1[0][0][i];
}
assert(x >= s[0]);
for (int j = K - 1; ~j; --j) {
if (dp1[1][j][i] < n) {
x += dp2[1][j][i];
i = dp1[1][j][i];
}
}
if (i < n) {
x += dp2[1][0][i];
i = dp1[1][0][i];
}
assert(i == n);
return x;
}
