#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>

#define INF 0x3f3f3f3f
#define Nmax 100005

using namespace std;

int _newX,A,B,pos,answer;

class SegmentTree{
public:
    vector<int> range;
    SegmentTree(){}
    void Resize(int lg){
        range.resize(1<<((int)ceil(log2((double)lg))+1));
    }
    void Update(int li,int lf,int pz)
    {
        if(li == lf){
            range[pz] = max(range[pz],_newX);
            return;
        }
        int m = li + ((lf - li) >> 1);
        if( pos <= m )
            Update(li,m,pz<<1);
        else
            Update(m+1,lf,(pz<<1)|1);
        range[pz] = max(range[pz<<1],range[(pz<<1)|1]);
    }
    void Querry(int li,int lf,int pz)
    {
        if(A <= li && lf <= B){
            answer = max(answer,range[pz]);
            return;
        }
        int m = li + ((lf - li) >> 1);
        if(A <= m)
            Querry(li,m,pz<<1);
        if(B > m )
            Querry(m+1,lf,(pz<<1)|1);
    }
};
SegmentTree Aint;

int maxim[Nmax],daddy[Nmax],weight[Nmax],castig[Nmax];
int locatie[Nmax];
int N,S,M;

int whos_ur_daddy(int k)
{
    if(daddy[k] != k)
        daddy[k] = whos_ur_daddy(daddy[k]);
    return daddy[k];
}

void couple(int a,int b) /// a , b are tree roots
{
    if(a > b)
        swap(a,b);
    maxim[b] = max(maxim[a],maxim[b]);
    daddy[a] = b;
    if(b > S)
    {
        _newX = maxim[b];
        pos = b - S;
        Aint.Update(1,N,1);
    }
}


void Read()
{
    scanf("%d%d%d",&N,&S,&M);
    Aint.Resize(N);
    for(int i = 1; i <= S; ++i){
        scanf("%d",&maxim[i]);
        daddy[i] = i;
    }
    for(int i = S + 1; i <= S + N; ++i){
        daddy[i] = i;
        maxim[i] = 0;
    }
}

void Solve()
{
    char op;
    int tip,a,b;
    for(int i = 1; i <= M; ++i)
    {
        scanf("%c",&op);
        while(op == '\n')
            scanf("%c",&op);
        if(op == 'U')
        {
            scanf("%d%d%d\n",&tip,&a,&b);
            if(tip == 2)
                a += S;
            couple(whos_ur_daddy(a),whos_ur_daddy(b));

        }else
        {
            scanf("%d%d\n",&A,&B);
            answer = 0;
            Aint.Querry(1,N,1);
            printf("%d\n",answer);
        }
    }
}

int main()
{
    freopen("tabara2.in","r",stdin);
    freopen("tabara2.out","w",stdout);

    Read();
    Solve();

    return 0;
}