#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
#define eb emplace_back
#define rng(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,b) rng(i,0,b)
#define all(x) x.begin(),x.end()
#define si(x) (int)(x.size())
using ll=long long;
using P=pair<int,int>;
#define tct template<class t>
#define tctu template<class t,class u>
tct using vc=vector<t>;
using vi=vc<int>;
tctu bool chmax(t&a,u b){if(a<b){a=b;return 1;}return 0;}
tctu bool chmin(t&a,u b){if(a>b){a=b;return 1;}return 0;}
constexpr int inf = 100000000;

using uint=unsigned;
const uint mod=1000000007;
struct mint{
	uint v;
	mint(ll vv=0){s(vv%mod+mod);}
	mint&s (uint vv){
		v=vv<mod?vv:vv-mod;
		return *this;
	}
	mint operator-()const{return mint()-*this;}
	mint&operator+=(mint r){return s(v+r.v);}
	mint&operator-=(mint r){return s(v+mod-r.v);}
	mint&operator*=(mint r){v=(unsigned ll)v*r.v%mod;return *this;}
	mint&operator/=(mint r){return *this*=r.inv();}
	mint operator+(mint r)const{return mint(*this)+=r;}
	mint operator-(mint r)const{return mint(*this)-=r;}
	mint operator*(mint r)const{return mint(*this)*=r;}
	mint operator/(mint r)const{return mint(*this)/=r;}
	mint pow(ll n)const{
		if(n<0)return inv().pow(-n);
		mint res(1),x(*this);
		while(n){
			if(n&1) res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	mint inv()const{return pow(mod-2);}
};
int n;
vi edge[200005];
int dep[200005],up[20][200005];
void dfs(int v,int u,int d){
	dep[v] = d;
	up[0][v] = u;
	for(auto to:edge[v]){
		if(to == u) continue;
		dfs(to,v,d+1);
	}
}
int lca(int a,int b){
	if(dep[a]>dep[b])swap(a,b);
	int dif = dep[b]-dep[a];
	rep(i,20) if(((dif>>i)&1)) b = up[i][b];
	if(a == b) return a;
	for(int i=19;i>=0;i--){
		if(up[i][a] != up[i][b]){
			a = up[i][a];
			b = up[i][b];
		}
	}
	return up[0][a];
}
int tw[200005];
int one[50005],two[50005];

void solve(){
	tw[0]=1;
	rng(i,1,200005) tw[i]=tw[i-1]*2%mod;
	cin>>n;
	rep(i,n-1){
		int u,v;cin>>u>>v;
		edge[u].pb(v);
		edge[v].pb(u);
	}
	dfs(1,-1,0);
	rep(j,19){
		rng(i,1,n+1){
			if(up[j][i] == -1) up[j+1][i] = -1;
			else up[j+1][i] = up[j][up[j][i]];
		}
	}
	int q;cin>>q;
	vc<pair<int,P>>Q(q);
	vi imp;
	rep(i,q){
		string s;
		int u,v;cin>>s>>u>>v;
		if(s=="+") Q[i].a = 1;
		Q[i].b = P(u,v);
		imp.pb(lca(u,v));
	}
	sort(all(imp));
	imp.erase(unique(all(imp)),imp.end());
	vi rv(n+1,-1);
	rep(i,si(imp)) rv[imp[i]] = i;
	vi cmp(n+1);
	vi up2(si(imp),-1);
	vi dep2(si(imp),0);
	auto dfs2=[&](auto self,int v,int u,int cur)->void{
		if(rv[v] != -1){
			up2[rv[v]] = cur;
			if(cur != -1) dep2[rv[v]] = dep2[cur]+1;
			cur = rv[v];
		}
		cmp[v] = cur;
		for(auto to:edge[v]){
			if(to == u) continue;
			self(self,to,v,cur);
		}
	};
	dfs2(dfs2,1,-1,-1);
	/*rng(i,1,n+1){
		cout<<cmp[i]<<endl;
	}
	rep(i,si(imp))cout<<imp[i]<<' ';cout<<endl;
	rep(i,si(imp)){
		cout<<up[i]<<endl;
	}*/
	ll ans=0;
	rep(i,q){
		int ty = Q[i].a;
		auto [u,v] = Q[i].b;
		u = cmp[u];
		v = cmp[v];
		if(dep2[u] > dep2[v]) swap(u,v);
		while(dep2[u] < dep2[v]){
			if(ty){
				ans+=tw[one[v]]; 
				ans-=tw[two[v]]; one[v]++; two[v]++;
			}
			else{
				ans-=tw[one[v]-1]; 
				ans+=tw[two[v]-1]; one[v]--; two[v]--;
			}
			v = up2[v];
		}
		while(1){
			if(u == v){
				if(ty){
					ans+=tw[one[v]];one[v]++;
				}
				else{
					ans-=tw[one[v]-1];one[v]--;
				}
				break;
			}
			else{
				if(ty){
					ans+=tw[one[v]]; ans+=tw[one[u]];  
					ans-=tw[two[v]]; ans-=tw[two[u]]; 
					one[v]++;one[u]++;two[v]++;two[u]++;
				}
				else{
					ans-=tw[one[v]-1]; ans-=tw[one[u]-1]; 
					ans+=tw[two[v]-1]; ans+=tw[two[u]-1]; 
					one[v]--;one[u]--;two[v]--;two[u]--;
				}
				v = up2[v];
				u = up2[u];
			}
		}
		ans=(ans%mod+mod)%mod;
		cout<<ans<<'\n';
	}
}
	
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	solve();
}