#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 500000;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    template<class U> modular(const U& v) {
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }

    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular exp(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { 
        auto i = invGeneral(a.val,MOD); assert(i != -1);
        return i;
    } // equivalent to return exp(b,MOD-2) if MOD is prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

const int BLOCK = 6000;
// NlogN to recalculate 
// Q*(Q+1)/2 == NlogN

template<class T, int SZ> struct BIT {
    T bit[SZ];
    void upd(int a, int b) { ckmin(a,SZ-1); for (;a<SZ;a+=(a&-a)) bit[a] += b; }
    T sum(int a) { ckmin(a,SZ-1); T res = 0; for (;a;a-=(a&-a)) res += bit[a]; return res; }
};

int N,Q,p[MX],depth[MX],a[MX];

int co;
vi child[MX], fake[MX], tmp;
vector<array<int,3>> inc, qnum[MX];
vpi qtree[MX], upd[MX];
BIT<ll,MX> B[3];

vl ans;

pi bound[MX];

int ord;
void genBound(int x) {
    bound[x].f = ord++;
    trav(t,child[x]) genBound(t);
    bound[x].s = ord-1;
}

void dfs(int x) {
    trav(y,qtree[x]) ans[y.s] -= B[0].sum(y.f);
    trav(y,qnum[x]) ans[y[2]] -= y[1]*B[1].sum(y[0]);
    trav(y,upd[x]) B[2].upd(y.f,y.s);
    
    B[0].upd(depth[x],a[x]); B[1].upd(depth[x],1);
    a[x] += B[2].sum(MX-1)-B[2].sum(depth[x]-1);
    trav(t,child[x]) dfs(t);
    
    trav(y,qtree[x]) ans[y.s] += B[0].sum(y.f);
    trav(y,qnum[x]) ans[y[2]] += y[1]*B[1].sum(y[0]);
    trav(y,upd[x]) B[2].upd(y.f,-y.s);
}

void calc() {
    inc.clear();
    F0R(i,2) B[i] = BIT<ll,MX>();
    dfs(0);
    F0R(i,co) {
        qnum[i].clear();
        qtree[i].clear();
        upd[i].clear();
    }
    // deal with inc ... 
    trav(t,tmp) {
        child[t].insert(child[t].end(),all(fake[t]));
        fake[t].clear();
    }
    FOR(t,N,co) {
        child[t].insert(child[t].end(),all(fake[t]));
        fake[t].clear();
    }
    tmp.clear();
    ord = 0; genBound(0);
    FOR(i,1,co) assert(bound[i] != mp(0,0));
    N = co; 
}

bool above(int a, int b) {
    return bound[a].f <= bound[b].f && bound[b].s <= bound[a].s;
}

void dfs0(int v, int d, int x) {
    if (depth[v] > d) return;
    if (v >= N) a[v] += x;
    trav(t,fake[v]) dfs0(t,d,x);
}

ll dfs1(int v, int d) {
    if (depth[v] > d) return 0;
    ll sum = (v >= N ? a[v] : 0);
    trav(t,fake[v]) sum += dfs1(t,d);
    return sum;
}

int main() {
    setIO(); re(N,Q);
    F0R(i,N) {
        re(p[i],a[i]);
        if (i) {
            tmp.pb(p[i]); fake[p[i]].pb(i);
            depth[i] = depth[p[i]]+1;
        } else depth[i] = 1;
    }
    co = N; N = 0; calc();
    for (int i = 0; i < Q; i += BLOCK) {
        FOR(j,i,min(i+BLOCK,Q)) {
            int t; re(t);
            if (t == 1) {
                int v,d,x; re(v,d,x); d += depth[v];
                if (v >= N) dfs0(v,d,x);
                else {
                    trav(t,tmp) if (above(v,t)) dfs0(t,d,x);
                    inc.pb({v,d,x}); upd[v].pb({d,x});
                }
            } else if (t == 2) {
                int v,d; re(v,d); d += depth[v];
                ans.pb(0);
                if (v >= N) {
                    ans.back() += dfs1(v,d);
                } else {
                    trav(t,tmp) if (above(v,t)) {
                        // ps("ZZ",sz(ans),t,d);
                        ans.back() += dfs1(t,d);
                    }
                    qtree[v].pb({d,sz(ans)-1});
                    trav(t,inc) {
                        if (above(t[0],v)) {
                            qnum[v].pb({min(t[1],d),t[2],sz(ans)-1});
                        } else if (above(v,t[0])) {
                            qnum[t[0]].pb({min(t[1],d),t[2],sz(ans)-1});
                        }
                    }
                }
            } else {
                re(p[co],a[co]); 
                depth[co] = depth[p[co]]+1;
                fake[p[co]].pb(co);
                if (p[co] < N && find(all(tmp),p[co]) == tmp.end()) tmp.pb(p[co]);
                co ++;
            }
        }
        calc();
    }
    trav(t,ans) ps(t);
    // F0R(i,N) ps("HA",i,a[i]);
}


/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Measured memory_bytes: 395248