#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
read some solutions long back and remember some ideas from there
*/
const int MOD = 1e9 + 7;
const int N = 5e4 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int LOG = 25;
#include "dungeons.h"
#define data DATA
struct data{
ll sum,mx;
data(){
sum = 0;
mx = -inf2;
}
data(ll x, ll y){
sum = x;
mx = y;
}
};
data merge(data &left, data &right){
data curr;
curr.sum = left.sum + right.sum;
curr.mx = max(left.mx,left.sum+right.mx);
return curr;
}
int up[LOG][N][LOG];
data dat[LOG][N][LOG];
int n;
vector<int> s,p,w,l;
void init(int n_, std::vector<int> s_, std::vector<int> p_, std::vector<int> w_, std::vector<int> l_) {
n = n_;
s = s_;
p = p_;
w = w_;
l = l_;
rep(j,LOG){
rep(i,n){
if(s[i] < (1<<j)){
// win
up[j][i][0] = w[i];
dat[j][i][0] = data(s[i],-inf2);
}
else{
// lose
up[j][i][0] = l[i];
dat[j][i][0] = data(p[i],-s[i]);
}
}
rep(k,LOG){
up[j][n][k] = n;
dat[j][n][k] = data();
}
rep1(k,LOG-1){
rep(i,n){
up[j][i][k] = up[j][up[j][i][k-1]][k-1];
dat[j][i][k] = merge(dat[j][i][k-1],dat[j][up[j][i][k-1]][k-1]);
}
}
}
}
long long simulate(int x, int z_) {
ll z = z_;
while(true){
// find first win over a big guy
int j = 63-__builtin_clzll(z);
amin(j,24);
rev(k,LOG-1,0){
auto &d = dat[j][x][k];
if(z+d.mx >= 0) conts;
x = up[j][x][k];
z += d.sum;
}
if(x == n) break;
assert(z >= s[x]);
assert(s[x] >= (1<<j));
z += s[x];
x = w[x];
}
return z;
}
