#include <vector>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
#define mx 400000

int n; ll s[mx], p[mx]; int w[mx], l[mx];
int a[mx+1][25]; ll b[mx+1][25], c[mx+1], d[mx+1][25];

void init(int N, vi S, vi P, vi W, vi L)
{
    n = N;
    for (int i = 0; i < n; i++) s[i] = S[i], p[i] = P[i], w[i] = W[i], l[i] = L[i];
    //follow lose-cycle, binary lift
    //a = final location, b = gain, c = finish, d = min to escape
    for (int i = 0; i < n; i++) a[i][0] = l[i], b[i][0] = p[i], d[i][0] = s[i];
    a[n][0] = n;
    for (int t = 1; t < 25; t++) for (int i = 0; i <= n; i++)
        a[i][t] = a[a[i][t-1]][t-1], b[i][t] = b[i][t-1]+b[a[i][t-1]][t-1],
        d[i][t] = min(d[i][t-1],d[a[i][t-1]][t-1]-b[i][t-1]);
    for (int i = n-1; i >= 0; i--) c[i] = c[w[i]] + s[i];
}
ll simulate(int x, int z)
{
    for (int t = 24; t >= 0; t--) if (z < d[x][t]) x = a[x][t], z += b[x][t];
    if (z < s[x]) x = w[x], z += s[x];
    return z + c[x];
}