#include <bits/stdc++.h>

#define task "disconnect"
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; }
#define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; }
#define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; }
#define PR(A, l, r) { cerr << '\n'; rep(_, l, r) DB1(A, _); cerr << '\n';}
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define pf push_front
#define F first
#define S second
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; } // sort(arr, arr + N, by(a));
#define next ___next
#define prev ___prev
#define y1 ___y1
#define left ___left
#define right ___right
#define y0 ___y0
#define div ___div
#define j0 ___j0
#define jn ___jn

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
const int N = 1e5 + 3;
int n, m, st[N], ed[N], bit[N], neu, dep[N], pa[17][N];
vi g[N];
void upd(int p, int v)
{
    for (; p <= n; p += p & (-p)) bit[p] += v;
}
int query(int p)
{
    int res = 0;
    for (; p; p -= p & (-p)) res += bit[p];
    return res;
}
void dfs(int u, int p)
{
    st[u] = ++neu;
    dep[u] = dep[p] + 1;
    pa[0][u] = p;
    rep(k, 1, 16) pa[k][u] = pa[k - 1][pa[k - 1][u]];
    for (int v : g[u]) if (v != p)
        dfs(v, u);
    ed[u] = neu;
}
int lca(int x, int y)
{
    if (dep[x] < dep[y]) swap(x, y);
    Rep(k, 16, 0) if (dep[pa[k][x]] >= dep[y]) x = pa[k][x];
    if (x == y) return x;
    Rep(k, 16, 0) if (pa[k][x] != pa[k][y]) x = pa[k][x], y = pa[k][y];
    return pa[0][x];
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    freopen("disconnect.in", "r", stdin);
    freopen("disconnect.out", "w", stdout);
    cin >> n >> m;
    rep(i, 2, n)
    {
        int u, v;
        cin >> u >> v;
        g[u].eb(v);
        g[v].eb(u);
    }
    dfs(1, 0);
    //PR(eul, 1, neu);
    int vv = 0;
    while (m--)
    {
        int t, x, y, u, v;
        cin >> t >> x >> y;
        u = x ^ vv;
        v = y ^ vv;
        int z = lca(u, v);
        if (t == 1)
        {
            if (pa[0][v] == u) swap(u, v);
            upd(st[u], 1);
            upd(ed[u] + 1, -1);
        } else
        {
            int du = query(st[u]);
            int dv = query(st[v]);
            int dz = query(st[z]);
            if (du + dv - 2 * dz > 0)
            {
                cout << "NO\n";
                vv = v;
            } else
            {
                cout << "YES\n";
                vv = u;
            }
        }
    }
    return 0;
}