#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;
ll inf=1e18;
const int N=5e5+100,bs=701;
int A[N],AA[N],n,m,k,q,h[N],sz[N],L[N],R[N],t,szz[N],fen[N][2],pos[N];
vector<int>g[N];
multiset<int> nod;
int seg[N*4];
ll ans,fact[N],inv[N];
ll px(ll a,ll b){
ll ans=1;
while(b){
if(b&1)ans=ans*a%mod;
b>>=1;
a=a*a%mod;
}
return ans;
}
ll C(int r,int n){
if(r<0 || r>n)return 0;
return fact[n]*inv[r]%mod*inv[n-r]%mod;
}
void updd(int i,int x,int l=1,int r=n+1,int v=1){
if(r-l==1){
seg[v]=x;
return;
}
int mid=(l+r)>>1;
if(i<mid)updd(i,x,l,mid,v<<1);
else updd(i,x,mid,r,v<<1|1);
seg[v]=max(seg[v<<1],seg[v<<1|1]);
}
int gett(int rx,int l=1,int r=n+1,int v=1){
if(l>=rx || seg[v]<rx)return 0;
if(r-l==1)return l;
int mid=(l+r)>>1;
int ans=gett(rx,mid,r,v<<1|1);
if(ans==0)return gett(rx,l,mid,v<<1);
return ans;
}
void upd(int i,int x,int t){
for(;i<N;i+=i&-i)fen[i][t]+=x;
}
int get(int i,int t){
int ans=0;
for(;i>0;i-=i&-i)ans+=fen[i][t];
return ans;
}
int get(int l,int r,int t){
return get(r,t)-get(l-1,t);
}
void dfs(int v,int p=0){
L[v]=++t;pos[t]=v;
sz[v]=1;
for(int u:g[v])if(u!=p){h[u]=h[v]+1;dfs(u,v);sz[v]+=sz[u];}
R[v]=t;
}
void ad(int v,int o=1){
if(AA[v]>=0){
if(o==1)ans=ans*C(szz[v]-1,szz[v]+AA[v]-1)%mod;
else ans=ans*px(C(szz[v]-1,szz[v]+AA[v]-1),mod-2)%mod;
}
if(o==1){
updd(L[v],R[v]);
upd(L[v],AA[v],0);
upd(L[v],szz[v],1);
nod.insert(AA[v]);
}
else{
updd(L[v],0);
upd(L[v],-AA[v],0);
upd(L[v],-szz[v],1);
nod.erase(nod.find(AA[v]));
}
}
int main(){
fast_io
fact[0]=inv[0]=1;
for1(N-1){
fact[i]=fact[i-1]*i%mod;
inv[i]=px(fact[i],mod-2);
}
cin>>n>>A[1];
for1(n-1){
int u,v;cin>>u>>v;
g[u].pb(v);
g[v].pb(u);
}
dfs(1);
AA[1]=A[1];szz[1]=sz[1];
nod.insert(AA[1]);
ans=1;ad(1);
cout<<ans<<endl;
cin>>q;
while(q--){
int t,v,x;cin>>t>>v;
if(t==2){
int mn=pos[gett(L[v])];
ad(v,-1);
ad(mn,-1);
AA[mn]+=AA[v];szz[mn]+=szz[v];
ad(mn);
}
else{
cin>>x;
A[v]=AA[v]=x;
szz[v]=sz[v];
AA[v]-=get(L[v],R[v],0);
szz[v]-=get(L[v],R[v],1);
int mn=pos[gett(L[v])];
ad(v);
ad(mn,-1);
AA[mn]-=AA[v];szz[mn]-=szz[v];
ad(mn);
}
if((*nod.begin())<0){cout<<"0\n";continue;}
cout<<ans<<endl;
}
}
