// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
#define int long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,ll>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f3f3f3f3f

struct mat{
    int a[2][2];
    mat(){
        memset(a,63,sizeof a);
    }
};
int n,m,a[maxn];


mat get(int w){
    mat a;
    a.a[0][0]=a.a[1][1]=0;
    a.a[0][1]=a.a[1][0]=w;
    return a;
}

int tr[maxn<<2];
int pl[maxn],pr[maxn];
void up(int p){
    tr[p]=tr[p<<1]+tr[p<<1|1];
    tr[p]=min(tr[p],a[p]);
}
void build(int p,int l,int r){
  //  cout<<"build "<<p<<" "<<l<<" "<<r<<endl;
    pl[p]=l,pr[p]=r;
    if(l+1==r){
        tr[p]=a[p];
        return;
    }
    int mid=l+r>>1;
    build(p<<1,l,mid);
    build(p<<1|1,mid,r);
    up(p);
}

void upd(int p,int to){
    a[p]=to;
    up(p);
    while(p>>=1) up(p);
}

map<int,int>mp[2];
void wk(int u,int o){

    auto ins=[&](int x,int w){
        if(!mp[o].count(x)) mp[o][x]=w;
        else mp[o][x]=min(mp[o][x],w);
    };
    
    int l=u,r=u+1,dl=0,dr=0;
    int p=u+(1<<n);
    if(u==(1<<n)) l=u-1,r=u,dr=0,p=u-1+(1<<n),dl=a[p];
    else dl=0,dr=a[p];

    ins(l,dl);
    ins(r,dr);

    while(p>1){
        int q=p>>1;
        int nl=inf,nr=inf;
        if(p%2==0) {
            nl=dl,nr=dr+tr[q<<1|1];
        }else{
            nr=dr,nl=dl+tr[q<<1];
        }
        nr=min(nr,nl+a[q]);
        nl=min(nl,nr+a[q]);
        dl=nl,dr=nr,p=q;

        ins(pl[q],dl);
        ins(pr[q],dr);
    }
}
int ask(int u,int v){
    For(i,0,1) mp[i].clear();
    wk(u,0);
    wk(v,1);
    int res=inf;
    for(auto [t,ds]:mp[0]){
        if(mp[1].count(t)) res=min(res,ds+mp[1][t]);
    }
    return res;
}

signed main()
{
    cin>>n;
    For(i,1,(1<<(n+1))-1)cin>>a[i];
    build(1,0,(1<<n));
    cin>>m;
    For(_,1,m){
      //  cout<<"NOW "<<_<<endl;
        int op,x,y;
        cin>>op>>x>>y;
        if(op==1){
            upd(x,y);
        }else{
            cout<<ask(x,y)<<endl;
        }
    }
	return 0;
}
/*
[li,ri]
*/