#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long int
#define isr(u,c) (e[c][e[c][u].f].ch[1] == u)
#define isrt(u,c) (!e[c][u].f || (e[c][e[c][u].f].ch[0] != u && e[c][e[c][u].f].ch[1] != u))
using namespace std;
const int maxn = 10005,maxm = 100005,INF = 200000000;inline int read(){int out = 0,flag = 1;char c = getchar();while (c < 48 || c > 57) {if (c == '-') flag = -1; c = getchar();}while (c >= 48 && c <= 57) {out = out * 10 + c - 48; c = getchar();}return out * flag;
}int N,M,C,K,temp[maxn];
int edge[maxn][11][3];struct node{int w,f,ch[2],rev,Max;node() {f = ch[0] = ch[1] = rev = 0;}
}e[11][maxn];inline void push_up(int u,int c){e[c][u].Max = max(e[c][u].w,max(e[c][e[c][u].ch[0]].Max,e[c][e[c][u].ch[1]].Max));
}inline void pd(int u,int c){if (e[c][u].rev){swap(e[c][u].ch[0],e[c][u].ch[1]);e[c][e[c][u].ch[0]].rev ^= 1;e[c][e[c][u].ch[1]].rev ^= 1;e[c][u].rev = 0;}
}inline void push_down(int u,int c){int i = 0;do {temp[++i] = u;} while(!isrt(u,c) && (u = e[c][u].f));while (i) pd(temp[i--],c);
}inline int Find(int u,int c){while (e[c][u].f) u = e[c][u].f;return u;
}inline void spin(int u,int c){int s = isr(u,c),fa = e[c][u].f;e[c][u].f = e[c][fa].f;if(!isrt(fa,c)) e[c][e[c][fa].f].ch[isr(fa,c)] = u;e[c][fa].ch[s] = e[c][u].ch[s^1];if(e[c][u].ch[s^1]) e[c][e[c][u].ch[s^1]].f = fa;e[c][fa].f = u;e[c][u].ch[s^1] = fa;push_up(fa,c);
}inline void splay(int u,int c){push_down(u,c);while (!isrt(u,c)){if(isrt(e[c][u].f,c)) spin(u,c);else if(isr(u,c) ^ isr(e[c][u].f,c)) spin(u,c),spin(u,c);else spin(e[c][u].f,c),spin(u,c);}push_up(u,c);
}inline void Access(int u,int c){for (int v = 0; u; u = e[c][v = u].f){splay(u,c);e[c][u].ch[1] = v;if (v) e[c][v].f = u;push_up(u,c);}
}inline void Make_root(int u,int c){Access(u,c); splay(u,c);e[c][u].rev ^= 1;
}inline bool Link(int u,int v,int c){if(Find(u,c) == Find(v,c)){printf("Error 2.\n");return false;}Make_root(u,c); Access(v,c); splay(v,c);e[c][u].f = v;return true;
}inline void Cut(int u,int v,int c){Make_root(u,c); Access(v,c); splay(v,c);e[c][v].ch[0] = 0;e[c][u].f = 0;push_up(v,c);
}inline void Change(int u,int w){for (int i = 0; i < C; i++){Access(u,i); splay(u,i);e[i][u].w = w;push_up(u,i);}
}inline int Query(int u,int v,int c){if(Find(u,c) != Find(v,c)) return -1;Make_root(u,c); Access(v,c); splay(v,c);return e[c][v].Max;
}void init(){for (int i = 0; i <= 10; i++) e[i][0].Max = -INF;N = read();M = read();C = read();K = read();int u,v,w;for (int i = 1; i <= N; i++){w = read();for (int j = 0; j < C; j++)e[j][i].w = e[j][i].Max = w;}while (M--){u = read();v = read();w = read();Link(u,v,w);edge[u][w][++edge[u][w][0]] = v;edge[v][w][++edge[v][w][0]] = u;}
}void solve(){int k,x,y,z,c;while (K--){k = read();if (k == 0){x = read(); y = read();Change(x,y);}else if (k == 1){x = read(); y = read(); z = read();c = -1;for (int i = 0; i < C; i++)for (int j = 1; j <= edge[x][i][0]; j++)if (edge[x][i][j] == y){c = i;if (edge[x][i][0] == 2 && j == 1) swap(edge[x][i][1],edge[x][i][2]);if (edge[y][i][0] == 2 && edge[y][i][1] == x) swap(edge[y][i][1],edge[y][i][2]);break;}if (c == -1) printf("No such edge.\n");else if(c == z) printf("Success.\n");else if(edge[x][z][0] == 2 || edge[y][z][0] == 2) printf("Error 1.\n");else{if (Link(x,y,z)){edge[x][c][0]--;edge[y][c][0]--;edge[x][z][++edge[x][z][0]] = y;edge[y][z][++edge[y][z][0]] = x;Cut(x,y,c);printf("Success.\n");}}}else{c = read(); x = read(); y = read();printf("%d\n",Query(x,y,c));}}
}int main()
{init();solve();return 0;
}