#include <bits/stdc++.h>
#define ll long long
#define endll '\n';
#define pb push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 5e5 + 9;

struct node
{
   int value;
   map<int, int> mp;
};

node t[4 * N];
int lazy[4 * N];
int a[N];

void push(int n, int b, int e)
{ // update specific node by lazy
   if (lazy[n] == -1)
   {
      return;
   }
   t[n].mp[lazy[n]]++;
   //  = t[n].value | lazy[n];
   if (b != e)
   {
      int mid = (b + e) / 2, l = 2 * n, r = 2 * n + 1;
      lazy[l] = (lazy[n]);
      lazy[r] = (lazy[n]);
   }
   lazy[n] = -1;
}

node merge(node l, node r)
{ // what question need ??
   if (l.value == -1)
      return r;
   if (r.value == -1)
      return l;
   node ans;
   ans;
   for (auto i : l.mp)
   {
      ans.mp[i.first] += i.second;
   }
   for (auto i : r.mp)
   {
      ans.mp[i.first] += i.second;
   }
   return ans;
}

void build(int n, int b, int e)
{
   lazy[n] = -1;
   if (b == e)
   {
      t[n].mp[a[b]]++;
      return;
   }
   int mid = (b + e) / 2, l = 2 * n, r = 2 * n + 1;
   build(l, b, mid);
   build(r, mid + 1, e);
   t[n] = merge(t[l], t[r]);
}

void upd(int n, int b, int e, int i, int j, int v)
{
   push(n, b, e);
   if (e < i or j < b)
      return;
   if (b >= i and e <= j)
   {
      // lazy[n] = v; // set lazy
      // push(n, b, e);
      t[n].mp[a[b]]--;
      t[n].mp[v]++;
      return;
   }
   int mid = (b + e) / 2, l = 2 * n, r = 2 * n + 1;
   upd(l, b, mid, i, j, v);
   upd(r, mid + 1, e, i, j, v);
   t[n] = merge(t[l], t[r]);
}

node query(int n, int b, int e, int i, int j)
{
   node x;
   x.value = -1;
   push(n, b, e);
   if (e < i or j < b)
      return x; // resutl
   if (b >= i and e <= j)
   {
      return t[n]; // result
   }
   int mid = (b + e) / 2, l = 2 * n, r = 2 * n + 1;
   return merge(query(l, b, mid, i, j), query(r, mid + 1, e, i, j)); // result
}

vector<int> g[N];
map<int, map<char, int>> frq;
int step = 1;
int start[N], endd[N];
int vis[N];
void dfs(int u, int p = 1)
{
   start[u] = step;
   vis[u] = 1;
   for (auto v : g[u])
   {
      if (vis[v] == 0)
      {
         step++;
         dfs(v, u);
      }
   }
   endd[u] = step;
}
void solve()
{

   int n;
   cin >> n;
   for (int i = 1; i <= n; i++)
   {
      char ch;
      cin >> ch;
      frq[i][ch]++;
      a[i] = ch - 'a';
   }

   for (int i = 1; i < n; i++)
   {
      int u, v;
      cin >> u >> v;
      g[u].pb(v);
      g[v].pb(u);
   }

   dfs(1);
   build(1, 1, n);
   // for (int i = 1; i <= n; i++)
   // {
   //    cout << start[i] << " " << endd[i] << endl;
   // }

   // for (int i = 1; i <= n; i++)
   // {
   //    node x = query(1, 1, n, start[i], endd[i]);
   //    for (auto j : x.mp)
   //    {
   //       cout << j.first << " " << j.second << endl;
   //    }
   //    cout << endll;
   // }
   int q;
   cin >> q;
   while (q--)
   {
      int op;
      cin >> op;
      if (op == 1)
      {
         int pos;
         char ch;
         cin >> pos >> ch;
         upd(1, 1, n, pos, pos, ch - 'a');
         a[pos] = ch - 'a';
      }

      else
      {

         int z;
         cin >> z;
         node x = query(1, 1, n, start[z], endd[z]);
         // cout << "For z = " << z << endll;
         // cout << start[z] << " " << endd[z] << endl;
         vector<pair<int, int>> v;

         for (auto i : x.mp)
         {
            if (i.second)
            {
               v.push_back({i.second, i.first});
            }
         }

         sort(all(v), [&] (const pair<int,int> v1, const pair<int,int> v2) {
            if(v1.first == v2.first) {
               return v1.second < v2.second;
            }
            return v1.first > v2.first;
         });
         cout << char(v.front().second + 'a') << endll;
      }
   }
}

int32_t main()
{
   ios::sync_with_stdio(false);
   cin.tie(0);
   int t = 1;
   // cin >> t;
   while (t--)
   {
      solve();
   }
   return 0;
}