#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long , long long > pl;
const int N=1e6+1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,x,y,r,z,h,a[1234567],w;
bool used[1234567],used1[1234567];
pl p[1234567];
string s,s1[1234567];
map<ll,ll> mp;
map<pl,ll> mpl;
vector<pl> vec,vec1,ansvec;
vector<ll> v[1234567],v1[1234567];
vector<ll> vp[1234567];
set<ll> st;
stack <ll> sta;
set<ll> c1[1234][1234];
void dfs(ll x,ll y,ll sz){
used[x]=1;
//cout<<x<<" "<<y<<" "<<sz<<'\n';
st.insert(x);
for(auto u:v[x]){
if(used[u]==1 || *c1[x][u].rbegin() < y)con;
//cout<<x<<" "<<u<<" "<<y<<" "<<*c1[x][u].rbegin()<<'\n';
dfs(u,y,sz+1);
}
}
struct node{
ll x,y,w;
}str[1234567];
int main(){
cin>>n>>m;
rep(i,1,n){
rep(j,1,n)c1[i][j].insert(MIN);
}
rep(i,1,m){
cin>>x>>y>>z;
c1[x][y].insert(z);
c1[y][x].insert(z);
str[i].w=z;
str[i].x=x;
str[i].y=y;
v[x].pb(y);
v[y].pb(x);
}
cin>>k;
rep(i,1,k){
ll a,b;
cin>>a;
if(a==1){
cin>>a>>b;
c1[str[a].x][str[a].y].erase(str[a].w);
c1[str[a].y][str[a].x].erase(str[a].w);
str[a].w=b;
c1[str[a].x][str[a].y].insert(str[a].w);
c1[str[a].y][str[a].x].insert(str[a].w);
}
else{
cin>>a>>b;
mx=0;
st.clear();
dfs(a,b,1);
cout<<st.size()<<'\n';
rep(j,1,n)used[j]=0;
}
}
}
