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

int n; ll s[mx], p[mx]; int w[mx], l[mx];
bool task3 = 1;
int a[mx][25]; ll b[mx][25], c[mx], d[mx][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];
    for (int i = 1; i < n; i++) if (s[i] != s[0]) task3 = 0;
    if (task3)
    {
        //follow lose-cycle, binary lift
        //a = final location, b = gain, d = min needed 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]);
        //c = gain from i to n
        for (int i = n-1; i >= 0; i--) c[i] = c[w[i]] + s[i];
    }
}
ll simulate(int x, int z)
{
    if (task3)
    {
        for (int t = 24; t >= 0; t--) if (z < d[x][t]) x = a[x][t], z += b[x][t];
        if (z < s[x]) z += s[x], x = w[x];
        return z + c[x];
    }
    while (x != n)
    {
        if (z >= s[x]) z += s[x], x = w[x];
        else z += p[x], x = l[x];
    }
    return z;
}