//qoj10179
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 10;
int n, fa[N], ban[N], nw, siz[N], hav[N], stn;
vector<int> g[N];
vector<int> qq[N];
int nt, vis[N];

void initialize(int N, vector<int> A, vector<int> B){
    n = N;
    stn = 1;
    nt = 1;
    for(int i = 1; i <= n; ++ i){
        vector<int> ().swap(g[i]);
        vector<int> ().swap(qq[i]);
        fa[i] = 1;
        ban[i] = siz[i] = 0;
        hav[i] = 0;
        vis[i] = 0;
    }
    for(int i = 0; i < n - 1; ++ i){
        g[A[i]+1].push_back(B[i] + 1);
        g[B[i]+1].push_back(A[i] + 1);
    }
}

int generate(int u, bool res){
    ++ u;
    ++ nt;
    if(res == 1){
        nw -= siz[fa[u]] / 2;
        ++ siz[fa[u]];
        hav[u] = 1;
        nw += siz[fa[u]] / 2;
        return nw;
    }
    ban[u] = 1;
    nw -= siz[fa[u]] / 2;
    static int ss[N], ql[N], qr[N], sm[N];
    int tp = 0;
    for(int i : g[u]){
        if(!ban[i]){
            ss[++tp] = i;
            vector<int> ().swap(qq[tp]);
            qq[tp].push_back(i);
            ql[tp] = qr[tp] = 0;
            vis[i] = nt;
            sm[tp] = 0;
        }
    }
    int ed = 0;
    vis[u] = nt;
    while(ed < tp - 1){
        for(int i = 1; i <= tp; ++ i){
            if(ql[i] <= qr[i]){
                int x = qq[i][ql[i]];
                ++ ql[i];
                for(int y : g[x]){
                    if(!ban[y] && vis[y] != nt){
                        vis[y] = nt;
                        ++ qr[i];
                        qq[i].push_back(y);
                    }
                }
                if(ql[i] > qr[i]){
                    sm[i] = 1;
                    ++ ed;
                }
            }
            if(ed == tp - 1){
                break;
            }
        }
    }
    int lp = fa[u];
    for(int i = 1; i <= tp; ++ i){
        if(sm[i]){
            printf("[%d]: ", i);
            ++ stn;
            for(int j : qq[i]){
                printf("%d ", j);
                fa[j] = stn;
                if(hav[j]){
                    ++ siz[stn];
                    -- siz[lp];
                }
            }
            nw += siz[stn] / 2;
            puts("");
        }
    }
    nw += siz[lp] / 2;
    return nw;
}

#ifndef ONLINE_JUDGE

void my_assert(bool x){
    if (!x){
        puts("Wrong input");
        exit(0);
    }
}
 
int main(){
    int N, Q;
    my_assert(scanf("%d %d", &N, &Q) == 2);
    
    std::vector<int> A(N-1), B(N-1);
    for (int i=0;i<N-1;i++){
        my_assert(scanf("%d %d", &A[i], &B[i]) == 2);
        my_assert(0 <= A[i] && A[i] <= N-1);
        my_assert(0 <= B[i] && B[i] <= N-1);
        my_assert(A[i] != B[i]);
    }
    
    initialize(N, A, B);
    std::vector<int> ans(Q);
    std::vector<int> V(Q), R(Q);
    for (int i=0;i<Q;i++){
        my_assert(scanf("%d %d", &V[i], &R[i]) == 2);
        my_assert(0 <= V[i] && V[i] <= N-1);
        my_assert(R[i] == 0 || R[i] == 1);
        ans[i] = generate(V[i], R[i]==1);
        printf("%d\n", ans[i]);
    }
    cerr << stn << '\n';
}

#endif