#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> P;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<ll,ll,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
ll ne;
vector<pll> vn[800010];
ll par[60][800010];
ll dep[800010];
void lcadfs(ll v,ll p,ll d){
  par[0][v]=p;
  dep[v]=d;
  for(ll i=0;i<vn[v].size();i++){
    if(vn[v][i].first!=p)lcadfs(vn[v][i].first,v,d+1);
  }
}
void lcainit(ll n){
  lcadfs(ne,-1,0);
  for(ll i=0;i<59;i++){
    for(ll j=1;j<=n;j++){
      if(par[i][j]<0)par[i+1][j]=-1;
      else par[i+1][j]=par[i][par[i][j]];
    }
  }
}
ll lca(ll u,ll v){
    if(u==-1)return v;
    if(v==-1)return u;
  if(dep[u]>dep[v])swap(u,v);
  for(ll i=0;i<60;i++){
    if((dep[v]-dep[u])>>i&1)v=par[i][v];
  }
  if(u==v)return u;
  for(ll i=59;i>=0;i--){
    if(par[i][u]!=par[i][v]){
      u=par[i][u];
      v=par[i][v];
    }
  }
  return par[0][u];
}
int a[100001];
struct ST{
private:
    ll n;
    vector<ll> dat;
public:
    ST(ll k){
        ll sz=k;
        n=1;while(n<sz)n*=2;
        pll p={inf,inf};
        dat.resize(2*n-1,-1);
        rep(i,0,sz)dat[i+n-1]=a[i];
        rrep(i,n-2,0){
            dat[i]=lca(dat[i*2+1],dat[i*2+2]);
        }
    }
    void add(ll k,ll x){
        ll i=k+n-1;
        dat[i]=x;
        while(i>0){
            i=(i-1)/2;
            dat[i]=lca(dat[i*2+1],dat[i*2+2]);
        }
    }
    ll que(ll a,ll b,ll k=0,ll l=0,ll r=-1){
        if(r<0)r=n;
        if(b<=l||a>=r)return -1;
        if(a<=l&&b>=r)return dat[k];
        ll m1=que(a,b,2*k+1,l,(l+r)/2);
        ll m2=que(a,b,2*k+2,(l+r)/2,r);
        return lca(m1,m2);
    }
};

//neの指定！！
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    ne=0;
    int n,k,q;cin>>n>>k>>q;
    int c[n];
    rep(i,0,n)cin>>c[i];
    rep(i,0,k){
        cin>>a[i];
        a[i]--;
    }
    rep(i,0,n-1){
        int f,g;cin>>f>>g;
        f--;
        g--;
        vn[f].push_back({g,1});
        vn[g].push_back({f,1});
    }
    lcainit(n);
    ll dp[n];
    dp[0]=c[0];
    queue<pii> qq;
    
    qq.push({0,c[0]});
    while(qq.size()>0){
        pii p=qq.front();qq.pop();
        int now=p.first,ma=p.second;
        rep(i,0,vn[now].size()){
            int ne=vn[now][i].first;
            if(ne==par[0][now])continue;
            dp[ne]=max(c[ne],ma);
            qq.push({ne,dp[ne]});
        }
    }
    //cout<<1;return 0;
    ST st(k);
    rep(i,0,q){
        int t,x,y;cin>>t>>x>>y;
        x--;y--;
        if(t==1){
            st.add(x,y);
        }
        else{
            ll u=st.que(x,y+1);
            cout<<dp[u]<<endl;
        }
    }
}