#include <bits/stdc++.h>

using namespace std;

// LinkCutTree
// 各Heavy-edge連結成分を表すBSTをin-orderで捜査すると、元のパスになる
template<typename Monoid = int, typename OperatorMonoid = Monoid>
struct LinkCutTree {
  using F = function<Monoid(Monoid, Monoid)>;
  using G = function<Monoid(Monoid, OperatorMonoid, int)>;
  using H = function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;

  struct Node {
    Node *l, *r, *p;
    int idx;
    Monoid key, sum;
    OperatorMonoid lazy;

    bool rev;
    int sz;

    Node(int idx, const Monoid& key, const OperatorMonoid &om):l(nullptr), r(nullptr), p(nullptr), idx(idx), key(key), sum(key), lazy(om), rev(false), sz(1) {}

    bool is_root() {
      return !p || (p->l != this && p->r != this);
    }
  };

  const F f;
  const G g;
  const H h;
  const Monoid M1;
  const OperatorMonoid OM0;

  LinkCutTree():LinkCutTree([](Monoid a, Monoid b) {return a+b;}, Monoid()) {}
  LinkCutTree(const F &f, const Monoid &M1):LinkCutTree(f, G(), H(), M1, OperatorMonoid()) {}
  LinkCutTree(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) {}

  Node *make_node(int idx, const Monoid &v = Monoid()) {
    return new Node(idx, v, OM0);
  }

  void propagate(Node *t, const OperatorMonoid &x) {
    t->lazy = h(t->lazy, x);
    t->key = g(t->key, x, 1);
    t->sum = g(t->sum, x, t->sz);
  }

  void toggle(Node *t) {
    assert(t);
    swap(t->l, t->r);
    /*ここに反転処理*/
    t->rev ^= true;
  }

  void push(Node *t) {
    if(t->lazy != OM0) {
      if(t->l) propagate(t->l, t->lazy);
      if(t->r) propagate(t->r, t->lazy);
      t->lazy = OM0;
    }
    if(t->rev) {
      if(t->l) toggle(t->l);
      if(t->r) toggle(t->r);
      t->rev = false;
    }
  }

  void update(Node *t) {
    t->sz = 1;
    t->sum = t->key;
    if(t->l) t->sz += t->l->sz, t->sum = f(t->l->sum, t->sum);
    if(t->r) t->sz += t->r->sz, t->sum = f(t->sum, t->r->sum);
  }

  void rotr(Node *t) {
    auto *x = t->p, *y = x->p;
    if((x->l = t->r)) t->r->p = x;
    t->r = x, x->p = t;
    update(x), update(t);
    if((t->p = y)) {
      if(y->l == x) y->l = t;
      if(y->r == x) y->r = t;
      update(y);
    }
  }

  void rotl(Node *t) {
    auto *x = t->p, *y = x->p;
    if((x->r = t->l)) t->l->p = x;
    t->l = x, x->p = t;
    update(x), update(t);
    if((t->p = y)) {
      if(y->l == x) y->l = t;
      if(y->r == x) y->r = t;
      update(y);
    }
  }

  void splay(Node *t) {
    push(t);
    while(!t->is_root()) {
      auto *q = t->p;
      if(q->is_root()) { // zig
	push(q), push(t);
	if(q->l == t) rotr(t);
	else rotl(t);
      } else {
	auto *r = q->p;
	push(r), push(q), push(t);
	if(r->l == q) {
	  if(q->l == t) rotr(q), rotr(t); // zig zig
	  else rotl(t), rotr(t); // zig zag
	} else {
	  if(q->r == t) rotl(q), rotl(t); // zig zig
	  else rotr(t), rotl(t); // zig zag
	}
      }
    }
  }

  Node *expose(Node *t) {
    Node *rp = nullptr;
    for(Node *cur = t; cur; cur = cur->p /*Light-edgeで移動*/) {
      splay(cur); 
      cur->r = rp; // Heavy-edgeでつなぐ(元のHeavy-edgeは切れる)
      update(cur);
      rp = cur;
    }
    splay(t);
    return rp;
  }

  void link(Node *child, Node *parent) {
    expose(child);
    expose(parent);
    child->p = parent;
    parent->r = child;
  }

  void cut(Node *child) {
    expose(child);
    auto *parent = child->l;
    child->l = nullptr;
    parent->p = nullptr;
  }

  void evert(Node *t) {
    expose(t);
    toggle(t);
    push(t);
  }

  Node *lca(Node *u, Node *v) {
    expose(u);
    return expose(v);
  }

  vector<int> get_path(Node *x) {
    vector<int> vs;
    function<void(Node*)> dfs = [&](Node *cur) {
      if(!cur) return;
      dfs(cur->r);
      vs.push_back(cur->idx);
      dfs(cur->l);
    };
    expose(x);
    dfs(x);
    return vs;
  }

  void set_propagate(Node *t, const OperatorMonoid &x) {
    expose(t);
    propagate(t, x);
    push(t);
  }
};

int main() {
  int n;
  cin >> n;
  LinkCutTree<> tree;
  vector<LinkCutTree<>::Node*> nodes(n);
  for(int i = 0; i < n; ++i) nodes[i] = tree.make_node(i);
  for(int i = 0; i < n; ++i) {
    int k;
    cin >> k;
    while(k--) {
      int c;
      cin >> c;
      tree.link(nodes[c], nodes[i]);
    }
  }
  int q;
  cin >> q;
  while(q--) {
    int k;
    cin >> k;
    if(k) {
      int u;
      cin >> u;
      tree.expose(nodes[u]);
      cout << nodes[u]->sum << endl;
    } else {
      int v, w;
      cin >> v >> w;
      tree.expose(nodes[v]);
      nodes[v]->key += w;
    }
  }
  return 0;
}



Measured memory_bytes: 9992