#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

bool visited[100100];
vector<int> g[100100];
int l[100100],r[100100],m=1;
ll bitree[225816];

void dfs(int u){
	int i,v;
	visited[u] = true;
	for(i=(g[u].l_ength()-1); i>=0; --i){
		v = g[u][i];
		if(visited[v]){
			continue;
		}
		l[v] = m; ++m;
		dfs(v);
		r[v] = m; ++m;
	}
}

ll query(int x){
	ll v = 0ll;
	while(x){
		v += bitree[x];
		x -= (x&(-x));
	}
	return v;
}

void update(int x, ll v){
	while(x<=m){
		bitree[x] += v;
		x += (x&(-x));
	}
}

int main(void){
	int n,i,k,j,u,q;
	ll w;
	cin >> n;
	for(i=0; i<n; ++i){
		cin >> k;
		for(j=0; j<k; ++j){
			cin >> u;
			g[i].push_back(u);
		}
	}
	dfs(0);
	cin >> q;
	for(i=0; i<q; ++i){
		cin >> k;
		if(k){
			cin >> u;
			cout << query(l[u]) << endl;
		}else{
			cin >> u >> w;
			update(l[u],w);
			update(r[u],-w);
		}
	}
	return 0;
}

