// 那就是希望。
// 即便需要取模，也是光明。

#pragma GCC optimize("Ofast")

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
int LK[500005];llt LB[500005];std::vector<uint>V[1200005];
voi Merge(std::vector<uint>&A,std::vector<uint>&B,std::vector<uint>&Ans)
{
    Ans.clear(),Ans.reserve(A.size()+B.size());
    uint i=0,j=0;
    while(i<A.size()||j<B.size())
    {
        uint l=(j==B.size()||(i<A.size()&&LK[A[i]]<LK[B[j]]))?A[i++]:B[j++];
        while(Ans.size()>=2&&(LB[l]-LB[Ans[Ans.size()-2]])*(LK[Ans.back()]-LK[Ans[Ans.size()-2]])
            <=(LB[Ans.back()]-LB[Ans[Ans.size()-2]])*(LK[l]-LK[Ans[Ans.size()-2]]))Ans.pop_back();
        Ans.push_back(l);
    }
}
uint From[500005],tp;
voi push(uint id){V[From[tp++]]={id};}
voi pop(){tp--;for(uint i=From[tp];V[i].size();i++)V[i].clear();}
voi build(uint p,uint d)
{
    uint d0=d;while(V[From[p-1]+d].empty())d--,build(p-(1u<<d),d);
    while(d<d0)Merge(V[From[p-(1u<<d)-1]+d],V[From[p-1]+d],V[From[p-1]+d+1]),d++;
}
llt find(llt x)
{
    llt ans=1e18;
    uint d=0,p=tp;
    while(p)
    {
        while((lowbit(p)>>d)&&(V[From[p-1]+d].size()||p+(1u<<d)<=tp))d++;
        while(!(lowbit(p)>>d)||(V[From[p-1]+d].empty()&&p+(1u<<d)>tp))d--;
        build(p,d);
        auto&S=V[From[p-1]+d];uint l=0,r=S.size()-1;
        while(l<r){uint mid=(l+r)>>1;if(LK[S[mid]]*x+LB[S[mid]]<LK[S[mid+1]]*x+LB[S[mid+1]])r=mid;else l=mid+1;}
        _min(ans,LK[S[l]]*x+LB[S[l]]),p-=1u<<d;
    }
    ans+=x*x;
    return ans;
}
uint Op[500005],Id[500005];llt X[500005];uint P[500005];
std::vector<uint>Son[500005],Q[500005];uint Cnt[500005];
std::vector<std::pair<uint,std::pair<uint,uint> > >Insert;
voi dfs(uint p,uint f)
{
    static uint Last[500005],tp;
    if(!Op[p])Last[Id[p]]=tp;else if(Last[Id[p]]<tp)Insert.push_back({Id[p],{Last[Id[p]],tp}});
    for(auto s:Son[p])dfs(s,p);
    for(auto s:Q[p])P[s]=tp;
    if(Op[p])Last[Id[p]]=++tp;else Insert.push_back({Id[p],{Last[Id[p]],++tp}});
}
voi solve(uint l,uint r,std::vector<std::pair<uint,std::pair<uint,uint> > >&Insert)
{
    if(Cnt[l]==Cnt[r])return;
    uint c=0;for(auto s:Insert)if(s.second.first<=l&&s.second.second>=r)push(s.first),c++;
    if(l+1==r||Insert.empty())for(uint j=l;j<r;j++)for(auto q:Q[j])X[q]=find(X[q]);
    else
    {
        uint mid=(l+r)>>1;
        std::vector<std::pair<uint,std::pair<uint,uint> > >L,R;
        for(auto s:Insert)if(s.second.first>l||s.second.second<r)
        {
            if(s.second.first<mid)L.push_back(s);
            if(s.second.second>mid)R.push_back(s);
        }
        std::vector<std::pair<uint,std::pair<uint,uint> > >().swap(Insert);
        solve(l,mid,L),solve(mid,r,R);
    }
    while(c--)pop();
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint n,q;scanf("%u%u%lld",&n,&q,&LB[0]);
    for(uint i=1;i<=n;i++){From[i]=From[i-1];uint j=lowbit(i);do From[i]++;while((j>>=1));}
    for(uint i=1,f;i<n;i++)
    {
        scanf("%u%u%u",Op+i,&f,Id+i),Son[f].push_back(i);
        if(!Op[i]){llt x,c;scanf("%lld%*d%*d%lld",&x,&c),LK[Id[i]]=-2*x,LB[Id[i]]=c+x*x;}
    }
    for(uint i=0;i<q;i++)scanf("%u%lld",P+i,X+i),Q[P[i]].push_back(i);
    Insert.reserve(n),dfs(0,-1);
    for(uint i=0;i<n;i++)Q[i].clear();
    for(uint i=0;i<q;i++)Q[P[i]].push_back(i);
    for(uint i=0;i<n;i++)Cnt[i+1]=Cnt[i]+Q[i].size();
    solve(0,n,Insert);
    for(uint i=0;i<q;i++)printf("%lld\n",X[i]);
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。