/**************************************************************

     Problem: 2816

     User: dedicatus545

     Language: C++

     Result: Accepted

     Time:8032 ms

     Memory:6688 kb

 ****************************************************************/

 #include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<unistd.h>

 #define col(i,c) n*c+i

 using namespace std;

 inline int read(){

     int re=,flag=;char ch=getchar();

     while(ch>''||ch<''){

         if(ch=='-') flag=-;

         ch=getchar();

     }

     while(ch>=''&&ch<='') re=(re<<)+(re<<)+ch-'',ch=getchar();

     return re*flag;

 }

 struct edge{

     int to,next,w;

 }e[];

 int n,m,C,cnt=-,q,first[],color[][];

 int fa[]={},ch[][]={},w[],a[];

 bool rev[]={},rt[]={};

 void _swap(int &l,int &r){l^=r;r^=l;l^=r;}

 void update(int x){a[x]=max(a[ch[x][]],max(a[ch[x][]],w[x]));};

 void pushrev(int x){

     if(!x) return;

     _swap(ch[x][],ch[x][]);

     rev[x]^=;

 }

 void pushdown(int x){

     if(!x) return;

     if(rev[x]){

         pushrev(ch[x][]);

         pushrev(ch[x][]);

         rev[x]=;

     }

 }

 void push(int x){

     //cout<<"push "<<x<<' '<<rt[x]<<'\n';

     if(!x) sleep();

     if(!rt[x]) push(fa[x]);

     pushdown(x);

 }

 int get(int x){return ch[fa[x]][]==x;}

 void rotate(int x){

     //cout<<"rotate "<<x<<'\n';

     int f=fa[x],ff=fa[f],son=get(x);

     ch[f][son]=ch[x][son^];

     if(ch[f][son]) fa[ch[f][son]]=f;

     ch[x][son^]=f;fa[f]=x;

     fa[x]=ff;

     if(rt[f]) rt[x]=,rt[f]=;

     else ch[ff][ch[ff][]==f]=x;

     update(f);update(x);

 }

 void splay(int x){

     //cout<<"splay "<<x<<'\n';

     push(x);

     for(int f;!rt[x];rotate(x))

         if(!rt[f=fa[x]])

             rotate((get(x)==get(f))?f:x);

     update(x);

 }

 void access(int x){

     //cout<<"access "<<x<<'\n';

     int y=;

     do{

         splay(x);

         rt[ch[x][]]=;

         rt[ch[x][]=y]=;

         x=fa[y=x];

         update(x);

     }while(x);

 }

 void makeroot(int x){

     //cout<<"makeroot "<<x<<'\n';

     access(x);splay(x);pushrev(x);

 }

 bool judge(int x,int y){

     while(fa[x]) x=fa[x];

     while(fa[y]) y=fa[y];

     return x==y;

 }

 void init(int x,int y){

     //cout<<"init "<<x<<' '<<y<<'\n';

     makeroot(x);fa[x]=y;

 }

 int link(int x,int y){

     if(judge(x,y)) return ;

     makeroot(x);fa[x]=y;

     return ;

 }

 int cut(int x,int y){

     if(!judge(x,y)) return ;

     makeroot(x);splay(y);

     fa[ch[y][]]=fa[y];

     rt[ch[y][]]=;

     fa[y]=;ch[y][]=;

     return ;

 }

 void add(int u,int v,int w){

     e[++cnt]=(edge){v,first[u],w};first[u]=cnt;

     e[++cnt]=(edge){u,first[v],w};first[v]=cnt;

 }

 int split(int u,int v){

     if(!judge(u,v)) return -;

     makeroot(u);access(v);splay(v);

     return a[v];

 }

 int main(){

    // freopen("networkzj.in","r",stdin);

   //  freopen("networkzj.out","w",stdout);

     memset(first,-,sizeof(first));

     int i,j,t1,t2,t3,t4;

     n=read();m=read();C=read();q=read();

     for(i=;i<=n;i++){

         t1=read();

         for(j=;j<C;j++) a[col(i,j)]=w[col(i,j)]=t1,rt[col(i,j)]=;

     }

     for(i=;i<=m;i++){

         t1=read();t2=read();t3=read();

         init(col(t1,t3),col(t2,t3));

         add(t1,t2,t3);

         color[t1][t3]++;color[t2][t3]++;

     }

     //for(i=1;i<=n;i++){

         //for(j=0;j<C;j++) cout<<color[i][j]<<' ';

         //cout<<'\n';

     //}

     for(i=;i<=q;i++){

         //cout<<"operation "<<i<<'\n';

         t1=read();

         if(t1==){

             t2=read();t3=read();

             for(j=;j<C;j++){

                 makeroot(col(t2,j));w[col(t2,j)]=t3;update(col(t2,j));

             }

         }

         if(t1==){

             t2=read();t3=read();t4=read();bool flag=,f=;

             for(j=first[t2];~j;j=e[j].next)

                 if(e[j].to==t3){

                     flag=;

                     if(e[j].w==t4) f=;

                 }

             if(flag){

                 printf("No such edge.\n");

                 continue;

             }

             if(f&&(color[t2][t4]==||color[t3][t4]==)){

                 printf("Error 1.\n");continue;

             }

             if(f&&(judge(col(t2,t4),col(t3,t4)))){

                 printf("Error 2.\n");continue;

             }

             for(j=first[t2];~j;j=e[j].next){

                 if(e[j].to==t3){

                     color[t2][e[j].w]--;color[t3][e[j].w]--;

                     cut(col(t2,e[j].w),col(t3,e[j].w));

                     e[j].w=e[j^].w=t4;

                     color[t2][t4]++;color[t3][t4]++;

                     link(col(t2,t4),col(t3,t4));

                     printf("Success.\n");break;

                 }

             }

         }

         if(t1==){

             t2=read();t3=read();t4=read();

             printf("%d\n",split(col(t3,t2),col(t4,t2)));

         }

     }

 }