//```// YF YUSUF
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <set>
// #include <map>
// #include <algorithm>
// #include <cmath>
// #include <numeric>
// #include <queue>
// #include <stack>
// #include <cassert>
// #include <climits>
// #include <string>
// #include <cstdlib>
// #include <random>
// #include <iomanip>
// #include <ctime>
using namespace std;
#ifdef YF_CHECK
bool LOCAL = 1;
#else
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("O3")
bool LOCAL = 0;
#endif
using ll = long long;
using ld = long double;
using vll = vector <ll>;
using mll = map <ll,ll>;
using pll = pair <ll,ll>;
using vvl = vector <vll>;
using vpll = vector <pll>;
template<class T>T MIN(T&a,T b){a=min(a,b);return a;}
template<class T>T MAX(T&a,T b){a=max(a,b);return a;}
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sgr v+v+1,(tl+tr)/2+1,tr
#define sgl v+v,tl,(tl+tr)/2
#define pb push_back
#define ins insert
#define S second
#define F first
mt19937_64 MT(time(0));
ll BP(ll a,ll b,ll mod=1e9+7){
if(b==0)return 1;
ll q=BP(a,b/2,mod);
return ((q*q)%mod*(b%2?a:1ll))%mod;
}
ll f(ll x){return x*(x+1)/2;}
ll dup(ll a,ll b){return (a+b-1)/b;}
ll lcm(ll a,ll b){return a/__gcd(a,b)*b;}
ll invf(ll x){return (-1+sqrt(1+8*x))/2;}
ll lg(ll x){return (x ? 63 - __builtin_clzll(x) : -1);}
const ll mod=998244353;
const ll INF=1e18;
const ll inf=1e9+7;
const ll N =1e6+7;
ll n, m, q;
vpll g[N];
ll t[4*N];
ll merge(ll a,ll b){
return min(a, b);
}
ll worst = inf;
void up(ll pos,ll x,ll v=1,ll tl=1,ll tr=n){
if(tl==tr){
t[v]=x;
}
else{
ll tm=(tl+tr)/2;
if(pos<=tm)up(pos,x,sgl);
else up(pos,x,sgr);
t[v]=merge(t[v+v],t[v+v+1]);
}
}
ll get(ll l,ll r,ll v=1,ll tl=1,ll tr=n){
if(l > tr || tl > r || l>r)return worst;
if(l<= tl && tr<=r)return t[v];
ll tm=(tl+tr)/2;
return merge(get(l,r,sgl),get(l,r,sgr));
}
bool check(ll l,ll r,ll w){
if(l > r)swap(l, r);
return (get(l, r-1) >= w);
}
void YF_MAIN(ll TEST){
cin>>n>>m;
for(int i=1;i<=m;i++){
ll v, u, w;
cin>>v>>u>>w;
up(v, w);
}
cin>>q;
while(q--){
ll t, s, w;
cin>>t>>s>>w;
if(t == 1){
up(s, w);
} else if(t==2){
ll L, R; L = R = s;
{
ll l = 1, r = s;
while(l<=r){
ll mid = (l+r)/2;
if(check(s, mid, w)){
r = mid - 1;
L = mid;
}
else{
l = mid + 1;
}
}
} {
ll l = s, r = n, j = l;
while(l<=r){
ll mid = (l+r)/2;
if(check(s, mid, w)){
l = mid + 1;
R = mid;
}
else{
r = mid - 1;
}
}
}
cout<<R - L + 1<<"\n";
} else {}
}
}
const bool TECT=0;
const bool FLSH=1;
const ll SN=1e0 + 7; ll SM[SN];
const ll FN=1e0 + 7; ll FACT[FN], inv[FN], FMOD=inf;
ll PNK(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;}
ll CNK(ll n,ll k){return PNK(n,k)*inv[k ]%FMOD;}
void BEFORE(){
for(ll i=2;i<SN;i++){
if(SM[i])continue;
for(ll j=i;j<SN;j+=i)
MAX(SM[j],i);
}
FACT[0]=inv[0]=1;
for(int i=1;i<FN;i++){
FACT[i]=FACT[i-1]*i%FMOD;
inv[i]=BP(FACT[i],FMOD-2,FMOD);
}
}
signed main(){
// freopen(("input.txt"),"r",stdin);freopen(("output.txt"),"w",stdout);
if(FLSH){
ios_base::sync_with_stdio(0);
cout.setf(ios::fixed);
cout.precision(0);
cout.tie(0);
cin.tie(0);
}
int TEST=1;
if(TECT)
cin>>TEST;
BEFORE();
for(int T=1;T<=TEST;T++){
// cout<<"Case "<<T<<": ";
YF_MAIN(T);
cout<<(T==TEST ? "" : "\n");
}
return 0;
}
// YF YUSUF ```
