#pragma GCC optimize("Ofast")

#include "bits/stdc++.h"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define ar array

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const int INFi = 2e9;
const ll INF = 2e18;


void solve() {
    int n; cin >> n;
    n = 1 << n;
    vl c(n * 2);
    for(int i = 1; i < c.size(); ++i) cin >> c[i];
    auto d = c;
    for(int i = n - 1; i >= 1; --i) {
        d[i] = min(c[i], d[i * 2] + d[i * 2 + 1]);
    }
    auto Change = [&] (int i, ll x) {
        c[i] = x;
        for(; i >= 1; i /= 2) {
            d[i] = min(c[i], d[i * 2] + d[i * 2 + 1]);
        }
    };
    auto Find = [&] (int i) {
        vector<pair<int, ll>> res;
        i += n;
        res.emplace_back(i, 0);
        ar<ll, 2> result = {0, 0};
        int l = i;
        int r = i;
        if (i == n) {
            res.emplace_back(i + 1, d[i]);
            res.emplace_back(i + 2, d[i / 2]);
            r = i + 2;
            result[1] = d[i / 2];
        } else if (i % 2 == 0) {
            res.emplace_back(i - 1, d[i - 1]);
            res.emplace_back(i - 2, d[(i - 2) / 2]);
            l = i - 2;
            result[0] = d[(i - 2) / 2];
        } else {
            res.emplace_back(i - 1, d[i - 1]);
            res.emplace_back(i + 1, d[i]);
            l = i - 1;
            r = i + 1;
            result[0] = d[i - 1];
            result[1] = d[i];
        }

        int shift = 1;
        while ((1 << shift) < n) {
            ckmin(result[0], result[1] + d[l >> shift]);
            ckmin(result[1], result[0] + d[l >> shift]);
            res.emplace_back(l, result[0]);
            res.emplace_back(r, result[1]);
            int step = (1 << shift);
            if (l & step) {
                l -= step;
                result[0] += d[l >> shift];
            } else {
                result[1] += d[r >> shift];
                r += step;
            }
            shift++;
        }
        ckmin(result[0], result[1] + d[l >> shift]);
        ckmin(result[1], result[0] + d[l >> shift]);
        res.emplace_back(l, result[0]);
        res.emplace_back(r, result[1]);
        sort(all(res));
        return res;
    };

    int q; cin >> q;
    rep(_, q) {
        int tp; cin >> tp;
        if (tp == 1) {
            int j; ll x; cin >> j >> x;
            Change(j, x);
            continue;
        }
        int s, t; cin >> s >> t;
        auto val1 = Find(s);
        auto val2 = Find(t);
        ll ans = INF;
        for(auto &[v, dv] : val2) {
            int it = std::lower_bound(val1.begin(), val1.end(), make_pair(v, -1ll)) - val1.begin();
            if (it == val1.size() || val1[it].first != v) continue;
            ckmin(ans, val1[it].second + dv);
        }
        cout << ans << '\n';
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(8) << fixed;
    int t = 1;
//    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}

/*
 * 3
7 1 14 3 9 4 8 2 6 5 5 13 8 2 3
1
2 4 8

 */