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

-1
-1
80
170
180
170
190
170
250
280
280
270
370
380
580

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <cstring>
#include <string>
#include <map>
#include <set>
using namespace std;const int BufferSize = 1 << 16;
char buffer[BufferSize], *Head, *tail;
inline char Getchar() {if(Head == tail) {int l = fread(buffer, 1, BufferSize, stdin);tail = (Head = buffer) + l;}return *Head++;
}
int read() {int x = 0, f = 1; char c = Getchar();while(!isdigit(c)){ if(c == '-') f = -1; c = Getchar(); }while(isdigit(c)){ x = x * 10 + c - '0'; c = Getchar(); }return x * f;
}#define maxn 150010
#define maxm 750010
#define oo 2147483647
int n, q;int pa[maxn], pc[maxn];
int findset(int x) { return x == pa[x] ? x : pa[x] = findset(pa[x]); }
int findc(int x) { return x == pc[x] ? x : pc[x] = findc(pc[x]); }int fa[maxn], ch[maxn][2], sumv[maxn], val[maxn], A[maxn];
bool rev[maxn];
bool isroot(int u) { return ch[findc(fa[u])][0] != u && ch[findc(fa[u])][1] != u; }
void maintain(int u) {int lc = ch[u][0], rc = ch[u][1];sumv[u] = sumv[lc] + val[u] + sumv[rc];return ;
}
void pushdown(int u) {int &lc = ch[u][0], &rc = ch[u][1];if(rev[u]) {rev[u] = 0; swap(lc, rc);rev[lc] ^= 1; rev[rc] ^= 1;}return ;
}
void rotate(int u) {int y = findc(fa[u]), z = findc(fa[y]), l = 0, r = 1;if(ch[y][1] == u) swap(l, r);if(!isroot(y)) ch[z][ch[z][1]==y] = u;fa[u] = z; fa[y] = u; fa[ch[u][r]] = y;ch[y][l] = ch[u][r]; ch[u][r] = y;maintain(y); maintain(u);return ;
}
int S[maxn], top;
void splay(int u) {bool flag = 0;S[++top] = u;for(int t = u; !isroot(t); t = findc(fa[t])) S[++top] = findc(fa[t]);while(top) pushdown(S[top--]);if(flag) putchar('\n');while(!isroot(u)) {int y = findc(fa[u]), z = findc(fa[y]);if(!isroot(y)) {if((ch[y][0] == u) ^ (ch[z][0] == y)) rotate(u);else rotate(y);}rotate(u);}return ;
}
void access(int u) {for(int t = 0; u; u = fa[u]) {u = findc(u);splay(u); ch[u][1] = t; maintain(u); t = u;}return ;
}
void makeroot(int u) {access(u); splay(u); rev[u] ^= 1;return ;
}
void link(int a, int b) {makeroot(a); fa[a] = b;return ;
}
void split(int a, int b) {makeroot(b); access(a); splay(a);return ;
}void dfs(int u, int v) {if(!u) return ;pushdown(u);pc[u] = v;if(u != v) val[v] += val[u];dfs(ch[u][0], v); dfs(ch[u][1], v);ch[u][0] = ch[u][1] = 0;return ;
}int main() {n = read(); q = read();for(int i = 1; i <= n; i++) A[i] = val[i] = read(), pa[i] = pc[i] = i;while(q--) {int p = read(), a = read(), b = read();if(p == 1) {a = findc(a); b = findc(b); if(a == b) continue;int u = findset(a), v = findset(b);if(u != v) pa[v] = u, link(a, b);else {split(a, b); dfs(a, a); maintain(a);}}if(p == 2) {int c = findc(a);splay(c);val[c] += b - A[a]; A[a] = b;maintain(c);}if(p == 3) {a = findc(a); b = findc(b);int u = findset(a), v = findset(b);if(u != v) puts("-1");else split(a, b), printf("%d\n", sumv[a]);}}return 0;
}