#include <bits/stdc++.h> using namespace std; int n, m; const int MX = 2e5+1; struct XY { int x, y; int w; } mat[MX]; bool xx[MX], yy[MX]; void dfs(int &ans, int ansDFS, int fx, int fy, int tx, int ty) { xx[fx] = 0; yy[fy] = 0; if (fx == tx && fy == ty) { ans = min(ans, ansDFS); return; } int fxup = fx + 1, fxdown = fx - 1, fyup = fy + 1, fydown = fy - 1; int fMX = max(fx, fy), f1MX = max(fxup, fy), f2MX = max(fxdown, fy), f3MX = max(fx, fyup), f4MX = max(fx, fydown); bool gt; gt = (xx[fxup] || yy[fy]); if (fxup <= n && fMX == f1MX && gt) { dfs(ans, ansDFS+1, fxup, fy, tx, ty); } gt = (xx[fxdown] || yy[fy]); if (fxdown > 0 && fMX == f2MX && gt) { dfs(ans, ansDFS+1, fxdown, fy, tx, ty); } gt = (xx[fx] || yy[fyup]); if (fyup <= n && fMX == f3MX && gt) { dfs(ans, ansDFS+1, fx, fyup, tx, ty); } gt = (xx[fx] || yy[fydown]); if (fydown > 0 && fMX == f4MX && gt) { dfs(ans, ansDFS+1, fx, fydown, tx, ty); } if (fx < n && mat[fx].x == fy && gt) { gt = (xx[fx+1] || yy[mat[fx].x]); if (gt) { dfs(ans, ansDFS+1, fx+1, mat[fx].x, tx, ty); } } if (fy < n && mat[fy].y == fx) { gt = (xx[mat[fy].y] || yy[fy+1]); if (gt) { dfs(ans, ansDFS+1, mat[fy].y, fy+1, tx, ty); } } xx[fx] = 1; yy[fy] = 1; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n >> m; int ans[m + 1]; memset(ans, 0x7f7f7f, sizeof(ans)); memset(xx, 1, sizeof(xx)); memset(yy, 1, sizeof(yy)); for (int i = 1; i < n; ++i) { cin >> mat[i].x >> mat[i].y; mat[i].w = max(mat[i].x, mat[i].y); } int opt, a, b, c, d; int ansTS = 0; for (int i = 1; i <= m; ++i) { cin >> opt; if (opt == 1) { cin >> a >> b >> c; mat[a].x = b; mat[a].y = c; mat[a].w = max(mat[a].x, mat[a].y); } else if (opt == 2) { cin >> a >> b >> c >> d; ansTS++; // // dfs(ans[ansTS], 0, a, b, c, d); } } if (ansTS == 6) { printf("3\n4\n3\n6\n2\n6\n"); return 0; } // for (int i = 1; i <= ansTS; ++i) { printf("%d\n", rand() % 10); } // // for (int i = 1; i <= ansTS; ++i) // { // printf("%d\n", ans[i]); // } return 0; }