#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
#define int ll
int n, q;
int lt[MAX_N], rt[MAX_N];
int qt[MAX_N], pt[MAX_N], st[MAX_N], et[MAX_N];
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> q;
for (int i = 1;i < n;++i)
cin >> lt[i] >> rt[i], --rt[i];
if (n > 1000) return -1;
for (int qt, pt, st, et, at, bt, ct, dt, i = 0;i < q;++i) {
cin >> qt;
if (qt == 1) {
cin >> pt >> st >> et;
lt[pt] = st;
rt[pt] = et-1;
}
if (qt == 2) {
cin >> at >> bt >> ct >> dt;
ll time = bt, res = 0;
while (at < ct) {
chmax(time, lt[at]);
res += max<ll>(0, time - rt[at]);
chmin(time, rt[at]);
++time;
++at;
}
while (at > ct) {
--at;
chmax(time, lt[at]);
res += max<ll>(0, time - rt[at]);
chmin(time, rt[at]);
++time;
}
res += max<ll>(0, time - dt);
cout << res << '\n';
}
}
}
