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

#define V vector
#define pb push_back
#define fi first
#define se second
#define all0(x) (x).begin(), (x).end()
#define all1(x) (x).begin() + 1, (x).end()

typedef long long LL;
typedef pair<int, int> pi;

void solve() {
    int n;
    cin >> n;
    V<int> l(1 << n + 1);
    V<int> r(1 << n + 1);
    V<V<pi>> e((1 << n) + 1);
    V<int> val(1 << n + 1), true_val(1 << n + 1);
    auto ini = [&](int id, int L, int R, auto dfs) -> void {
        e[L].pb({R, 0});
        e[R].pb({L, 0});
        l[id] = L, r[id] = R;
        if (L == R - 1) {
            return;
        }
        int mid = L + R >> 1;
        dfs(id * 2, L, mid, dfs);
        dfs(id * 2 + 1, mid, R, dfs);
    };
    ini(1, 0, 1 << n, ini);
    auto set_val = [&](int id, int v) -> void {
        int L = l[id], R = r[id];
        for (auto &[y, w] : e[L]) {
            if (y == R) w = v;
        }
        for (auto &[y, w] : e[R]) {
            if (y == L) w = v;
        }
        val[id] = v;
    };
    auto upd_val = [&](int id, auto upd) -> void {
        int L = l[id], R = r[id];
        set_val(id, true_val[id]);
        if (L != R - 1) {
            set_val(id, min(true_val[id], val[id * 2] + val[id * 2 + 1]));
        }
        if (id != 1) upd(id / 2, upd);
    };
    auto chg_true = [&](int id, int v) -> void {
        true_val[id] = v;
        upd_val(id, upd_val);
    };
    for (int i = 1; i <= (1 << n + 1) - 1; i++) {
        int t;
        cin >> t;
        chg_true(i, t);
    }
    V<int> disa((1 << n) + 1), timea((1 << n) + 1);
    V<int> disb((1 << n) + 1), timeb((1 << n) + 1);
    int cur = 1;
    int q;
    cin >> q;
    V<int> vertex;
    // queue<int> que;
    V<int> que;
    int top = 0;
    auto run = [&](int x, V<int> &dis, V<int> &time) -> void {
        que.clear();
        top = 0;
        dis[x] = 0, time[x] = cur;
        que.push_back(x);
        while (top != que.size()) {
            int x = que[top++];
            vertex.pb(x);
            if (x == 0) continue;
            int lo = x & -x;
            if (x - lo >= 0) {
                int y = x - lo;
                int w;
                for (auto t : e[x]) {
                    if (t.fi == y) w = t.se;
                }
                if (time[x - lo] != cur)
                    time[x - lo] = cur, dis[x - lo] = 2e9;
                dis[x - lo] = min(dis[x - lo], dis[x] + w);
                que.push_back(x - lo);
            }
            if (x + lo <= (1 << n)) {
                int y = x + lo;
                int w;
                for (auto t : e[x]) {
                    if (t.fi == y) w = t.se;
                }
                if (time[x + lo] != cur)
                    time[x + lo] = cur, dis[x + lo] = 2e9;
                dis[x + lo] = min(dis[x + lo], dis[x] + w);
                que.push_back(x + lo);
            }
        }
    };
    for (int i = 1; i <= q; i++) {
        cur++;
        int t;
        cin >> t;
        if (t == 1) {
            int j, x;
            cin >> j >> x;
            chg_true(j, x);
        } else {
            int s, t;
            cin >> s >> t;
            run(s, disa, timea);
            run(t, disb, timeb);
            int ans = 2e9;
            for (auto x : vertex)
                if (timea[x] == timeb[x]) {
                    ans = min(ans, disa[x] + disb[x]);
                }
            vertex.clear();
            cout << ans << "\n";
        }
    }
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    solve();
}