// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));
const int INF = 1e9 , mod = 1e9 + 7;
template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }
template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}
template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }
template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }
template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }
template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }
#define PROB "a"
void file(){
if(fopen(PROB".inp", "r")){
freopen(PROB".inp","r",stdin);
freopen(PROB".out","w",stdout);
}
}
void sinh_(){
// srand(time(0));
// freopen(PROB".inp" , "w" , stdout);
// int n;
}
typedef long long ll;
typedef double db;
const int N = 1e5 + 5;
int n, m, q;
struct edge{
int u, v, w;
edge(int _u = 0, int _v = 0, int _w = 0) {
u = _u, v = _v, w = _w;
}
} Edge[N];
struct query{
int type, u, w;
query(int _type = 0, int _u = 0, int _w = 0) {
type = _type, u = _u, w = _w;
}
} Query[N];
vi adj[N];
int other(int x, int id) {
return x ^ Edge[id].u ^ Edge[id].v;
}
void readip(){
cin >> n >> m;
REP(i, 1, m) {
int u, v, w; cin >> u >> v >> w;
Edge[i] = edge(u, v, w);
adj[u].eb(i);
adj[v].eb(i);
}
cin >> q;
REP(i, 1, q) cin >> Query[i].type >> Query[i].u >> Query[i].w;
}
namespace sub1 {
vector<bool> vis;
void bfs(int s, int w) {
REP(i, 0, n) vis[i] = 0;
int cnt = 0;
queue<int> q;
vis[s] = 1;
q.push(s);
while(!q.empty()) {
int u = q.front(); ++cnt;
q.pop();
for (const int &id : adj[u]) {
int v = other(u, id);
if (vis[v] || Edge[id].w < w) continue;
vis[v] = true;
q.push(v);
}
}
cout << cnt << ln;
}
void solve() {
vis.assign(n + 5, 0);
REP(i, 1, q) {
if (Query[i].type == 1) {
Edge[Query[i].u].w = Query[i].w;
}
else {
bfs(Query[i].u, Query[i].w);
}
}
}
};
namespace sub2 {
struct segtree{
vector<int> it;
segtree(int _n = 0) {
if (_n > 0) {
it.assign(4 * n + 7, 0);
}
}
void upd(int u, int val, int id = 1, int l = 1, int r = n) {
if (l == r) {
it[id] = val;
return;
}
int mid = (l + r) >> 1;
if (u <= mid) upd(u, val, id << 1, l, mid);
else upd(u, val, id << 1 | 1, mid + 1, r);
it[id] = min(it[id << 1], it[id << 1 | 1]);
}
int walk_lef(int pos, int val, int id = 1, int l = 1, int r = n) {
if (l > pos) return n + 1;
if (1 <= l && r <= pos) {
int res = n + 1;
while(1) {
int mid = (l + r) >> 1;
if (l == r) return (it[id] >= val ? l : res);
if (it[id << 1 | 1] >= val) {
res = mid + 1;
r = mid;
id = id << 1;
}
else {
l = mid + 1;
id = id << 1 | 1;
}
}
}
int mid = (l + r) >> 1;
if (pos <= mid) return walk_lef(pos, val, id << 1, l, mid);
int tmp = walk_lef(pos, val, id << 1 | 1, mid + 1, r);
if (tmp > mid + 1) return tmp;
return min(mid + 1, walk_lef(pos, val, id << 1, l, mid));
}
int walk_rig(int pos, int val, int id = 1, int l = 1, int r = n) {
if (r < pos) return -1;
if (pos <= l && r <= n) {
int res = -1;
while(1) {
int mid = (l + r) >> 1;
if (l == r) return (it[id] >= val ? l : res);
if (it[id << 1] >= val) {
res = mid;
l = mid + 1;
id = id << 1 | 1;
}
else {
r = mid;
id = id << 1;
}
}
}
int mid = (l + r) >> 1;
if (pos > mid) return walk_rig(pos, val, id << 1 | 1, mid + 1, r);
int tmp = walk_rig(pos, val, id << 1, l, mid);
if (tmp < mid) return tmp;
return max(tmp, walk_rig(pos, val, id << 1 | 1, mid + 1, r));
}
} ST;
bool check() {
if (m != n - 1) return 0;
REP(i, 1, m) if (Edge[i].u != i || Edge[i].v != i + 1) return 0;
return 1;
}
void solve() {
ST = segtree(n);
REP(i, 1, m - 1) ST.upd(i, Edge[i].w);
REP(i, 1, q) {
if (Query[i].type == 1) {
ST.upd(Query[i].u, Query[i].w);
}
else {
int lef = Query[i].u, rig = Query[i].u;
if (Query[i].u > 1) minimize(lef, ST.walk_lef(Query[i].u - 1, Query[i].w));
if (Query[i].u < n) maximize(rig, ST.walk_rig(Query[i].u, Query[i].w) + 1);
cout << rig - lef + 1 << ln;
}
}
}
};
void solve(){
if (n <= 1000 && m <= 1000 && q <= 10000) {
sub1::solve();
return;
}
if (sub2::check()) {
sub2::solve();
return;
}
assert(0);
}
int main(){
sinh_();
io_faster
file();
int t = 1;
// cin >> t;
while (t--){
readip();
solve();
}
}
