#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int maxn=150010;
int n,m,tot;
int F[maxn],f[maxn],fa[maxn],rev[maxn],ch[2][maxn],s[maxn],v[maxn],V[maxn];
int find(int x)
{return (f[x]==x)?x:(f[x]=find(f[x]));
}
int Find(int x)
{return (F[x]==x)?x:(F[x]=Find(F[x]));
}
bool isr(int x) {return ch[0][find(fa[x])]!=x&&ch[1][find(fa[x])]!=x;}
void pushup(int x)
{s[x]=s[ch[0][x]]+s[ch[1][x]]+v[x];
}
void pushdown(int x)
{if(rev[x]){swap(ch[0][x],ch[1][x]);if(ch[0][x])    rev[ch[0][x]]^=1;if(ch[1][x])  rev[ch[1][x]]^=1;rev[x]=0;}
}
void updata(int x)
{if(!isr(x))    updata(find(fa[x]));pushdown(x);
}
void rotate(int x)
{int y=find(fa[x]),z=find(fa[y]),d=(x==ch[1][y]);if(!isr(y))   ch[y==ch[1][z]][z]=x;fa[x]=z,fa[y]=x,ch[d][y]=ch[d^1][x];if(ch[d^1][x])   fa[ch[d^1][x]]=y;ch[d^1][x]=y;pushup(y),pushup(x);
}
void splay(int x)
{updata(x);while(!isr(x)){int y=find(fa[x]),z=find(fa[y]);if(!isr(y)){if((x==ch[0][y])^(y==ch[0][z])) rotate(x);else  rotate(y);}rotate(x);}
}
void access(int x)
{for(int y=0;x;splay(x),ch[1][x]=y,pushup(x),y=x,x=find(fa[x]));
}
void maker(int x)
{access(x),splay(x),rev[x]^=1;
}
void dfs(int x,int y)
{f[x]=y;pushdown(x);if(ch[0][x])   dfs(ch[0][x],y);if(ch[1][x])    dfs(ch[1][x],y);
}
int rd()
{int ret=0,f=1;   char gc=getchar();while(gc<'0'||gc>'9')  {if(gc=='-')f=-f;  gc=getchar();}while(gc>='0'&&gc<='9')  ret=ret*10+gc-'0',gc=getchar();return ret*f;
}
int main()
{n=rd(),m=rd();int i,a,b,c,d;for(i=1;i<=n;i++) s[i]=V[i]=v[i]=rd(),F[i]=f[i]=i;for(i=1;i<=m;i++){c=rd(),a=rd(),b=rd();if(c==1){a=find(a),b=find(b);if(a==b)   continue;maker(a),access(b),splay(b);if(Find(a)!=Find(b))  fa[a]=b,F[F[a]]=F[b];else v[b]=s[b],dfs(b,b),ch[0][b]=ch[1][b]=0;}if(c==2)   d=a,a=find(a),splay(a),v[a]+=b-V[d],V[d]=b,pushup(a);if(c==3){a=find(a),b=find(b);if(Find(a)!=Find(b))    printf("-1\n");else   maker(a),access(b),splay(b),printf("%d\n",s[b]);}}return 0;
}//9 31 10 20 30 40 50 60 70 80 90 3 1 2 1 1 3 1 1 2 1 8 9 1 2 4 1 2 5 1 4 6 1 4 7 3 1 8 3 8 8 1 8 9 3 8 8 3 7 5 3 7 3 1 4 1 3 7 5 3 7 3 1 5 7 3 6 5 3 3 6 1 2 4 1 5 5 3 3 6 2 8 180 3 8 8 2 9 190 3 9 9 2 5 150 3 3 6 2 1 210 3 3 6