#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
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(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

template<class T, class E> struct LazySegTree{
    using F = function<T(T, T)>;
    using G = function<T(T, E)>;
    using H = function<E(E, E)>;
    using P = function<E(E, int)>;
    int sz = 1, seq_sz; F f; G g; H h; T et; E ee; P p;
    int cur = 0;
    vector<T> node;
    vector<E> lazy;
    vector<int> idx, len;

    LazySegTree(int sz_, T et_, E ee_, F f_, G g_, H h_, P p_=[](E a, int b){return a;}):
    seq_sz(sz_), et(et_), ee(ee_), f(f_), g(g_), h(h_), p(p_){
        while(sz < sz_) sz <<= 1;
        node.resize(sz<<1, et);
        lazy.resize(sz<<1, ee);
        idx.resize(sz, -1);
        len.resize(sz<<1, 0);
        For(i, sz, sz<<1) len[i] = 1;
        rFor(i, sz, 1) len[i] = len[i<<1] + len[(i<<1)+1];
    }

    void build(vector<T> &a){
        rep(i, a.size()) node[i+sz] = a[i];
        rFor(i, sz, 1) node[i] = f(node[i<<1], node[(i<<1)+1]);
    }

    void build(T x){
        rep(i, seq_sz) node[i+sz] = x;
        rFor(i, sz, 1) node[i] = f(node[i<<1], node[(i<<1)+1]);
    }

    inline void push(int i){
        if(lazy[i] == ee) return;
        if(i < sz) {
            lazy[i << 1] = h(lazy[i << 1], lazy[i]);
            node[i << 1] = g(node[i << 1], p(lazy[i], len[i << 1]));
            lazy[(i << 1) + 1] = h(lazy[(i << 1) + 1], lazy[i]);
            node[(i << 1) + 1] = g(node[(i << 1) + 1], p(lazy[i], len[(i << 1) + 1]));
        }
        lazy[i] = ee;
    }

    inline void prop(int l, int r){
        cur = 0;
        if(l == sz && r == sz<<1) return;
        l = (l / (l & -l)) >> 1;
        r = (r / (r & -r)) >> 1;
        while(l > 1 || r > 1){
            if(l >= r){
                idx[cur++] = l;
                l >>= 1;
            }
            else{
                idx[cur++] = r;
                r >>= 1;
            }
        }
        idx[cur++] = 1;

        rrep(k, cur) push(idx[k]);
    }

    void update(int l, int r, E x){
        l += sz; r += sz;
        prop(l, r);
        for(; l<r; l>>=1, r>>=1){
            if(l & 1){
                lazy[l] = h(lazy[l], x);
                node[l] = g(node[l], p(x, len[l]));
                ++l;
            }
            if(r & 1){
                --r;
                lazy[r] = h(lazy[r], x);
                node[r] = g(node[r], p(x, len[r]));
            }
        }
        rep(k, cur){
            int i = idx[k];
            if(i < sz) node[i] = f(node[i<<1], node[(i<<1)+1]);
        }
    }

    T query(int l, int r){
        l += sz; r += sz;
        prop(l, r);
        T vl = et, vr = et;
        for(; l<r; l>>=1, r>>=1){
            if(l & 1) vl = f(vl, node[l++]);
            if(r & 1) vr = f(node[--r], vr);
        }
        return f(vl, vr);
    }
};

template<class T> struct edge{
    int from, to; T cost;
    edge(int f, int t, T c): from(f), to(t), cost(c){}
};

template<typename T, typename E> struct HLDecomposition{
    int n;
    LazySegTree<T, E> *st;
    vector<vector<edge<T>>> G;
    vector<int> ttos, par, head;

    HLDecomposition(int n, LazySegTree<T, E> *st, bool edge_query=false): n(n), st(st){
        int k = (edge_query ? 2*n : n);
        G.resize(k);
        ttos.resize(k); par.resize(k); head.resize(k);
    }

    void add_edge(int a, int b, T c){
        G[a].emplace_back(a, b, c);
    }

    void build(bool edge_query=false){
        sz_dfs(0, -1);
        if(!edge_query){
            int idx = 0;
            ttos[0] = idx++;
            head[0] = 0;
            hld_dfs(0, -1, 0, idx);
        }
        else{
            int idx = 0;
            ttos[n] = idx++; ttos[0] = idx++;
            head[n] = n; head[0] = n;
            hld_dfs_edge(0, n, n, idx);
        }
    }

    int sz_dfs(int v, int pv){
        int ret = 0, tmax = 0;
        for(auto &e: G[v])if(e.to != pv){
            int tmp = sz_dfs(e.to, v);
            ret += tmp;
            if(chmax(tmax, tmp)) swap(G[v][0], e);
        }
        return ret + 1;
    }

    void hld_dfs(int v, int pv, int h, int &idx){
        for(auto &e: G[v])if(e.to != pv){
            int nv = e.to;
            ttos[nv] = idx++;
            par[nv] = v;
            head[nv] = (G[v][0].to == nv ? h : nv);
            hld_dfs(nv, v, head[nv], idx);
        }
    }

    void hld_dfs_edge(int v, int pv, int h, int &idx){
        for(auto &e: G[v])if(e.to != pv){
            int nv = e.to;
            ttos[nv+n] = idx++; ttos[nv] = idx++;
            par[nv+n] = v; par[nv] = nv+n;head[nv+n] = (G[v][0].to == nv ? h : nv+n); head[nv] = head[nv+n];
            hld_dfs_edge(nv, v, head[nv], idx);
        }
    }

    int lca(int a, int b){
        while(true){
            if(ttos[a] < ttos[b]) swap(a, b);
            if(head[a] == head[b]) return b;
            a = par[head[a]];
        }
    }

    /*void update(int a, T x, bool edge_query=false){
        st->update((edge_query ? ttos[a+n] : ttos[a]), x);
    }*/

    void update(int a, int b, T x){
        while(true){
            if(ttos[a] < ttos[b]) swap(a, b);
            if(head[a] == head[b]){
                st->update(ttos[b], ttos[a]+1, x);
                return;
            }
            st->update(ttos[head[a]], ttos[a]+1, x);
            a = par[head[a]];
        }
    }

    T query(int a, int b){
        T ret = st->et;
        while(true){
            if(ttos[a] < ttos[b]) swap(a, b);
            if(head[a] == head[b]){
                ret = st->f(ret, st->query(ttos[b], ttos[a]+1));
                return ret;
            }
            ret = st->f(ret, st->query(ttos[head[a]], ttos[a]+1));
            a = par[head[a]];
        }
    }
};

int main(){
    int n;
    scanf("%d", &n);
    LazySegTree<lint, lint> st(2*n, 0, 0, plus<>(), plus<>(), plus<>(), multiplies<>());
    HLDecomposition<lint, lint> hld(n, &st, true);
    rep(i, n){
        int k, c;
        scanf("%d", &k);
        rep(_, k){
            scanf("%d", &c);
            hld.add_edge(i, c, 0);
            hld.add_edge(c, i, 0);
        }
    }
    hld.build(true);

    int q;
    scanf("%d", &q);
    rep(_, q){
        int t, x; lint y;
        scanf("%d%d", &t, &x);
        if(t == 0){
            scanf("%lld", &y);
            hld.update(n, x, y);
        }
        else printf("%lld\n", (hld.query(n, x)-hld.query(n, 0))/2);
    }
}


Measured memory_bytes: 30260