#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define ll long long
ll mod = 998244353;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b)
{
ll res = 1;
while (b>0)
{
if (b&1)
res = (res*a)%mod;
a = (a*a)%mod;
b>>=1;
}
return res;
}
ll gcd(ll x, ll y)
{
if (y==0)
return x;
return gcd(y, x%y);
}
ll maxi = 303030;
vector<vector<ll>>g(maxi);
vector<ll>v(maxi), vis(maxi, 0);
vector<ll>vec;
void dfs(ll x)
{
vis[x] = 1;
vec.push_back(x);
for (auto i:g[x])
{
if (vis[i]==0)
dfs(i);
}
}
void solve()
{
ll n,s;
cin>>n>>s;
vector<ll>st;
for (int i=1 ; i<=n ;i++)
{
cin>>v[i];
ll x;
cin>>x;
if (x!=0)
{
g[x].push_back(i);
g[i].push_back(x);
}
else
st.push_back(i);
}
vector<pair<ll,ll>>vp;
for (auto i:st)
{
vec.clear();
dfs(i);
ll sum = 0, req = 0;
for (int j=0 ; j<vec.size() ; j++)
{
sum += v[vec[j]];
if (sum>=0)
{
vp.push_back({-req, sum});
sum = 0;
req = 0;
}
else
{
req = min(req, sum);
}
}
}
sort(vp.begin(), vp.end());
ll old = s;
for (auto i:vp)
{
if (i.first<=s)
s += i.second;
else
break;
}
cout<<s-old<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll tt = 1;
cin>>tt;
while (tt--)
{
solve();
}
return 0;
}
