#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

template<typename Monoid, typename OperatorMonoid=Monoid>
struct LazySegmentTree{
    using F=function<Monoid(Monoid,Monoid)>;
    using G=function<Monoid(Monoid,OperatorMonoid)>;
    using H=function<OperatorMonoid(OperatorMonoid,OperatorMonoid)>;
 
    int sz,height;
    vector<Monoid> data;
    vector<OperatorMonoid> lazy;
    const F f;
    const G g;
    const H h;
    const Monoid M1;
    const OperatorMonoid OM0;
 
    LazySegmentTree(int n,const F f,const G g,const H h,const Monoid &M1,const OperatorMonoid OM0)
    : f(f),g(g),h(h),M1(M1),OM0(OM0) {
        sz=1;height=0;
        while(sz<n) sz<<=1,height++;
        data.assign(2*sz,M1);lazy.assign(2*sz,OM0);
    }
 
    void set(int k,const Monoid &x){data[k+sz]=x;}
    void build(){for(int k=sz-1;k>0;k--) data[k]=f(data[2*k+0],data[2*k+1]);}
 
    inline void propagate(int k){
        if(lazy[k]!=OM0){
            lazy[2*k+0]=h(lazy[2*k+0],lazy[k]);
            lazy[2*k+1]=h(lazy[2*k+1],lazy[k]);
            data[k]=reflect(k);
            lazy[k]=OM0;
        }
    }
 
    inline Monoid reflect(int k){
        return lazy[k]==OM0?data[k]:g(data[k],lazy[k]);
    }
    inline void recalc(int k){
        while(k>>=1)data[k]=f(reflect(2*k+0),reflect(2*k+1));
    }
    inline void thrust(int k){
        for(int i=height;i>0;i--) propagate(k>>i);
    }
 
    void update(int a,int b,const OperatorMonoid &x){
        if(a>=b) return ;
        thrust(a+=sz);thrust(b+=sz-1);
        for(int l=a,r=b+1;l<r;l>>=1,r>>=1){
            if(l&1) lazy[l]=h(lazy[l],x),l++;
            if(r&1) --r,lazy[r]=h(lazy[r],x);
        }
        recalc(a);recalc(b);
    }
 
    Monoid query(int a,int b){
        thrust(a+=sz);thrust(b+=sz-1);
        Monoid L=M1,R=M1;
        for(int l=a,r=b+1;l<r;l>>=1,r>>=1){
            if(l&1) L=f(L,reflect(l++));
            if(r&1) R=f(reflect(--r),R);
        }
        return f(L,R);
    }
    
    Monoid operator[](const int &k){
        return query(k,k+1);
    }
}; 



signed main(){
    int n;cin>>n;
    using P=pair<int,ll>;
    vector<vector<P>> g(n);
    rep(i,n-1){
        int u,v;ll w;cin>>u>>v>>w;
        g[u].emplace_back(v,w);
    }
    vector<int> l(n),r(n);
    vector<int> et;
    vector<ll> x,y;
    int pos=0;
    function<void(int)> dfs=[&](int cur){
        l[cur]=pos++;
        et.push_back(cur);
        for(auto [to,c]:g[cur]){
            x.push_back(c);
            y.push_back(1);
            dfs(to);
            x.push_back(c);
            y.push_back(-1);
        }
        r[cur]=pos++;
    };

    dfs(0);

    struct segnode{
        ll val,pos,neg;
        segnode(ll val,ll pos,ll neg):val(val),pos(pos),neg(neg){}
    };

    auto segf=[&](segnode lhs,segnode rhs){
        return segnode(lhs.val+rhs.val,lhs.pos+rhs.pos,lhs.neg+rhs.neg);
    };
    auto segg=[&](segnode mugen,ll ad){
        return segnode(mugen.val+ad*mugen.pos-ad*mugen.neg,mugen.pos,mugen.neg);
    };
    auto segh=[&](ll cur,ll add){
        return cur+add;
    };

    LazySegmentTree<segnode,ll> seg(x.size(),segf,segg,segh,segnode(0,0,0),0);

    rep(i,(int)x.size()){
        seg.set(i,segnode(x[i]*y[i],(y[i]==1),(y[i]==-1)));
    }

    seg.build();
    int q;cin>>q;
    while(q--){
        int type;cin>>type;
        if(type==1){
            int v;ll ad;cin>>v>>ad;
            seg.update(l[v],r[v]-1,ad);
        }else{
            int b;cin>>b;
            cout<<seg.query(0,l[b]).val<<"\n";
        }
    }


    return 0;
}