#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ls tr[x][0]
#define rs tr[x][1]
#define father find(fa[x])
#define N 150009
using namespace std;
int bcj[N],f[N],tr[N][2],fa[N],size[N],val[N],n,m,v[N];
bool rev[N];
inline int rd(){int x=0;char c=getchar();bool f=0;while(!isdigit(c)){if(c=='-')f=1;c=getchar();}while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}return f?-x:x;
}
int find(int x){return f[x]=f[x]==x?x:find(f[x]);}
int fd(int x){return bcj[x]=bcj[x]==x?x:fd(bcj[x]);}
inline bool ge(int x){return tr[father][1]==x;}
inline bool isroot(int x){return tr[father][1]!=x&&tr[father][0]!=x;}
inline void pushup(int x){size[x]=size[ls]+size[rs]+val[x];}
inline void pushdown(int x){if(rev[x]){rev[ls]^=1;rev[rs]^=1;rev[x]^=1;swap(ls,rs);}}
inline void _pushdown(int x){if(!isroot(x))_pushdown(father);pushdown(x);}
inline void rotate(int x){int y=father,o=ge(x);tr[y][o]=tr[x][o^1];fa[tr[y][o]]=y;if(!isroot(y))tr[find(fa[y])][ge(y)]=x;fa[x]=fa[y];//!!!!fa[y]=x;tr[x][o^1]=y;pushup(y);pushup(x);
}
inline void splay(int x){_pushdown(x);while(!isroot(x)){int y=father;if(isroot(y))rotate(x);else rotate(ge(y)==ge(x)?y:x),rotate(x);}
}
inline void access(int x){for(int y=0;x;y=x,x=father)splay(x),tr[x][1]=y,pushup(x);}
inline void makeroot(int x){access(x);splay(x);rev[x]^=1;}
inline void split(int x,int y){makeroot(x);access(y);splay(y);}
inline void link(int x,int y){makeroot(x);fa[x]=y;}
void dfs(int x,int rt){f[x]=rt;pushdown(x);////!!!!!!if(ls)dfs(ls,rt);if(rs)dfs(rs,rt);
}
int main(){n=rd();m=rd();int opt,x,y;for(int i=1;i<=n;++i)f[i]=i,v[i]=val[i]=rd(),bcj[i]=i;for(int i=1;i<=m;++i){opt=rd();x=rd();y=rd();if(opt==1){x=find(x);y=find(y);if(x==y)continue;int tx=fd(x),ty=fd(y);if(tx!=ty){bcj[tx]=ty;link(x,y);}else{split(x,y);dfs(y,y);val[y]+=size[tr[y][0]];tr[y][0]=0;pushup(y);}}else if(opt==2){int cha=y-v[x];v[x]=y;x=find(x);access(x);splay(x);val[x]+=cha;pushup(x);}else{x=find(x);y=find(y);if(fd(x)!=fd(y)){printf("-1\n");continue;}split(x,y);printf("%d\n",size[y]);}}return 0;
}