#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<bitset>

using namespace std;

struct nod
{
    int lit[32];
}d[200032];

vector<int> a[100032];
queue<int> Q;
bitset<100032> fol;

void add(nod &a,nod &b)
{
    for(int i = 0; i<26; ++i)
        a.lit[i] += b.lit[i];
}

void odd(nod a, nod b)
{
    int cateodd = 0;

    for(int i = 0; i<26; ++i)
    {
        cateodd += ((a.lit[i] + b.lit[i])&1);
    }
    printf("%d\n",cateodd+1);
}

void afis(nod a)
{
    for(int i = 0; i<26; ++i)
    {
        printf("%d ",a.lit[i]);
    }
    printf("\n");
}

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

    int n,m;

    scanf("%d %d\n",&n,&m);
    char c[100010];
    fgets(c,n+1,stdin);

    for(int i = 0; i < n; ++i)
    {
        d[i+1].lit[c[i]-'a']++;
    }

    for(int i = 1;  i<n; ++i)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        a[x].push_back(y);
        a[y].push_back(x);
    }

    Q.push(1);
    fol[1] = 1;

    while(!Q.empty())
    {
        int cur = Q.front();
        Q.pop();

        for(int i = 0; i<a[cur].size(); ++i)
        {
            if(!fol[a[cur][i]])
            {
                add(d[a[cur][i]],d[cur]);
                fol[a[cur][i]] = 1;
                Q.push(a[cur][i]);
            }
        }
    }

    for(int i = 1; i<=m; ++i)
    {
        int type = 0;
        scanf("%d",&type);
        if(type == 1)
        {
            int x,y;
            scanf("%d %d",&x,&y);
            odd(d[x],d[y]);
        }
        else
        {
            int x;
            char cc;
            scanf("%d %c",&x,&cc);
            ++n;
            d[n].lit[cc-'a'] = 1;
            add(d[n],d[x]);
        }
    }

    return  0;
}