#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define lfs <<fixed<<setprecision(10)<<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = n - 1; i >= (ll)(m); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
template<typename T>
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}

struct edge{
  ll to,cost;
  edge(ll t,ll c):to(t),cost(c){};
};
struct HLD{
  ll n, root;
  vector<ll>sz;//部分木サイズ
  vector<ll>depth,par,hv_chi;
  vector<ll>head;
  vector<vector<struct edge>>g;//隣接リスト
  vector<struct edge>edges;//データ構造に乗せるedge列
  vector<ll>idx;//edge列のindexを下側の頂点から求めるor頂点列のindex
  vector<ll>subidx;//部分木に含まれる最後の頂点+1
  HLD(vector<vector<struct edge>>G,ll r)
      :g(G),n(G.size()),root(r){
    depth.assign(n,-1),par.assign(n,-1),hv_chi.assign(n,-1);
    sz.assign(n,-1),head.assign(n,-1),idx.assign(n,-1);
    subidx.assign(n,-1);
    edges.emplace_back(0,0);
    idx[root] = 0;
    dfs_sz(root,0);
    dfs_hl(root);
    subidx[root]=edges.size();
  }
  ll dfs_sz(ll k, ll d){
    depth[k] = d;
    ll sum_sz = 0;
    ll max_sz = 0,idx = -1;
    for(ll i=0;i<g[k].size();i++){
      if(depth[g[k][i].to] == -1){
        ll tmp_sz = dfs_sz(g[k][i].to, d+1); 
        sum_sz += tmp_sz;
        if(max_sz < tmp_sz)max_sz = tmp_sz,idx = g[k][i].to;
        par[g[k][i].to] = k;
      }
    }
    hv_chi[k] = idx;
    sz[k] = sum_sz + 1;
    return sz[k];
  }
  void dfs_hl(ll k){
    if(head[k]==-1)head[k]=k;
    for(ll i=0;i<g[k].size();i++){
      if(head[g[k][i].to]==-1&&hv_chi[k]==g[k][i].to){
        head[g[k][i].to] = head[k];
        idx[g[k][i].to]=edges.size();
        edges.push_back(g[k][i]);
        dfs_hl(g[k][i].to);
        subidx[g[k][i].to]=edges.size();
      }
    }
    for(ll i=0;i<g[k].size();i++){
      if(head[g[k][i].to]==-1&&hv_chi[k]!=g[k][i].to){
        idx[g[k][i].to]=edges.size();
        edges.push_back(g[k][i]);
        dfs_hl(g[k][i].to);
        subidx[g[k][i].to]=edges.size();
      }
    }
  }
  ll lca(ll p,ll q){
    while(1){
      if(depth[head[p]] > depth[head[q]])swap(p,q);
      if(head[p] == head[q])break;
      q = par[head[q]];
    }
    if(depth[p] > depth[q])swap(p,q);
    return p;
  }
  vector<pair<ll,ll>>query_path(ll p,ll q,bool isEdge){
    vector<ll>v = {p,q};
    ll r=lca(p,q);
    vector<pair<ll,ll>>ret;
    for(ll i=0;i<2;i++){
      while(1){
        if(isEdge&&v[i]==r)break;
        if(head[v[i]]==head[r]){
          ret.emplace_back(idx[r]+(isEdge?1:i),idx[v[i]]+1);
          break;
        }
        ret.emplace_back(idx[head[v[i]]],idx[v[i]]+1);
        v[i] = par[head[v[i]]];
      }
    }
    return ret;
  }

  pair<ll,ll>query_subtree(ll p,bool isEdge){
    return MP(idx[p]+1,subidx[p]);
  }
};


template<typename T>
struct LazySegmentTree{
  using F = function<T(T,T)>;
  vector<T> data, lazy; 
  ll n,lastlen = 1;
  F func = [](T a, T b){return a+b;};
  T iden = 0; //identity element
  F f_lazy = [](T a, T b){return a+b;};
  T iden_l = 0;
  F f_trans = [](T a, ll range){return a*(ll)range;};
  LazySegmentTree(vector<T> v){
    n = (ll)v.size();
    while(lastlen < n)lastlen *= 2;
    data.assign(lastlen*2-1,iden);
    lazy.assign(lastlen*2-1,iden_l);
    for(ll i=0;i<n;i++)data[i+lastlen-1] = v[i];
    for(ll i=lastlen-2;i>=0;i--){
      data[i] = func(data[2*i+1], data[2*i+2]);
    }
  }
  void eval(ll k, ll left, ll right){
    if(lazy[k] != iden_l){
      data[k] = f_lazy(data[k],
      f_trans(lazy[k],right-left));
      if(k <= lastlen - 2){
        lazy[2*k+1] = f_lazy(lazy[2*k+1],lazy[k]);
        lazy[2*k+2] = f_lazy(lazy[2*k+2],lazy[k]);
      }
      lazy[k] = iden_l;
    }
  }
  void update(ll a,ll b,T x,ll point=0LL,
  ll left=0LL,ll right=-1LL){
    if(right<0)right=lastlen;
    eval(point,left,right);
    if(b <= left || right <= a);
    else if(a <= left && right <= b ){
      lazy[point] = x;
      eval(point,left,right);
    }
    else{
      update(a,b,x,point*2+1, left, (left+right)/2);
      update(a,b,x,point*2+2, (left+right)/2, right);
      data[point] = func(data[2*point+1], data[2*point+2]);
    }      
  }
  T query(ll a,ll b,ll point=0LL,ll left=0LL,ll right=-1LL){
    if(right<0)right=lastlen;
    T ret = iden;
    eval(point,left,right);
    if(b <= left || right <= a);
    else if(a <= left && right <= b ){
      ret = func(ret,data[point]);
    }
    else{
      T p=query(a,b,point*2+1, left, (left+right)/2);
      T q=query(a,b,point*2+2, (left+right)/2, right);
      data[point] = func(data[2*point+1], data[2*point+2]);
      ret = func(ret,p);
      ret = func(ret,q);
    }      
    return ret;
  }
  void print(){
    ll num=0;
    for(ll i=lastlen;i>0;i/=2)num++;
    ll tmp=1;
    for(ll i=0;i<num;i++,tmp*=2){
      for(ll j=0;j<tmp;j++){
        if(data[tmp-1+j]==iden)cout<<"x"<<" ";
        else cout<<data[tmp-1+j]<<" ";
      };
      cout<<"|";
    }
    cout<<endl;
    tmp=1;
    for(ll i=0;i<num;i++,tmp*=2){
      for(ll j=0;j<tmp;j++){
        if(lazy[tmp-1+j]==iden_l)cout<<"x"<<" ";
        else cout<<lazy[tmp-1+j]<<" ";
      }
      cout<<"|";
    }
    cout<<endl;
  }
};

int main(){
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  ll res=0,res1=INF,res2=-INF,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<vector<struct edge>>g(n);
  for(ll i=0;i<n-1;i++){
    ll u,v,c;
    cin>>u>>v>>c;
    g[u].emplace_back(v,c);
    g[v].emplace_back(u,c);
  }
  HLD hld(g,0);
  vector<ll>es;
  rep(i,0,hld.edges.size())es.PB(hld.edges[i].cost);
  LazySegmentTree<ll>segtree(es);
  ll q;cin>>q;
  while(q--){
    ll sw;cin>>sw;
    if(sw==1){
      ll a,x;cin>>a>>x;
      auto p=hld.query_subtree(a,true);
      segtree.update(p.fi,p.se,x);
    }
    else {
      ll a;cin>>a;
      auto v=hld.query_path(0,a,true);
      ll ret=0;
      rep(i,0,v.size())ret+=segtree.query(v[i].fi,v[i].se);
      cout<<ret<<endl;
    }
  }
  return 0;
}