#include<bits/stdc++.h>
using namespace std;
const int N=4e5;
const int mod=1e9+7,iv=(mod+1)/2;
int inc(int x,int y){ return (x+=y)>=mod?x-mod:x; }
int sub(int x,int y){ return (x-=y)<0?x+mod:x; }
int n;
vector<int> e[N+5];
int fa[N+5];
int sz[N+5],son[N+5],top[N+5];
int dfn[N+5],rdfn[N+5],dfns;
struct Segtr{
    int tr[N*4+5],tag[N*4+5];
    #define lc id<<1
    #define rc id<<1|1
    void build(int l,int r,int id){
        tag[id]=1;
        if(l==r){
            tr[id]=rdfn[l]<=n?1:mod-1;
            return;
        }
        int mid=l+r>>1;
        build(l,mid,lc);
        build(mid+1,r,rc);
        tr[id]=inc(tr[lc],tr[rc]);
    }
    void push_down(int id){
        if(tag[id]==1) return;
        int v=tag[id]; tag[id]=1;
        tr[lc]=1ll*tr[lc]*v%mod; tag[lc]=1ll*tag[lc]*v%mod;
        tr[rc]=1ll*tr[rc]*v%mod; tag[rc]=1ll*tag[rc]*v%mod;
    }
    void add(int l,int r,int st,int en,int x,int id){
        if(st<=l&&en>=r){
            tr[id]=1ll*tr[id]*x%mod;
            tag[id]=1ll*tag[id]*x%mod;
            return;
        }
        int mid=l+r>>1;
        push_down(id);
        if(st<=mid) add(l,mid,st,en,x,lc);
        if(en>mid) add(mid+1,r,st,en,x,rc);
        tr[id]=inc(tr[lc],tr[rc]);
    }
}T;
void dfs1(int u,int tf){
    fa[u]=tf; sz[u]=1;
    for(auto v:e[u]){
        if(v!=tf){
            dfs1(v,u);
            sz[u]+=sz[v];
            if(sz[v]>sz[son[u]]) son[u]=v;
        }
    }
}
void dfs2(int u,int tf){
    top[u]=tf;
    dfn[u]=++dfns; rdfn[dfns]=u;
    if(!son[u]) return;
    dfs2(son[u],son[u]);
    for(auto v:e[u]){
        if(v!=fa[u]&&v!=son[u])
            dfs2(v,v);
    }
}
int LCA(int u,int v){
    while(top[u]!=top[v]){
        if(dfn[top[u]]<dfn[top[v]]) swap(u,v);
        u=fa[top[u]];
    }
    return dfn[u]<dfn[v]?u:v;
}
void work(int u,int v,int x){
    int lca=LCA(u,v);
    while(top[u]!=top[lca]){
        T.add(1,dfns,dfn[top[u]],dfn[u],x,1);
        u=fa[top[u]];
    }
    if(u!=lca) T.add(1,dfns,dfn[lca]+1,dfn[u],x,1);
    while(top[v]!=top[lca]){
        T.add(1,dfns,dfn[top[v]],dfn[v],x,1);
        v=fa[top[v]];
    }
    T.add(1,dfns,dfn[lca],dfn[v],x,1);
}
int main(){
    scanf("%d",&n);
    for(int i=1,u,v;i<n;i++){
        scanf("%d %d",&u,&v);
        e[u].push_back(i+n);
        e[v].push_back(i+n);
        e[i+n].push_back(u);
        e[i+n].push_back(v);
    }
    dfs1(1,0);
    dfs2(1,1);
    T.build(1,dfns,1);
    int q;
    scanf("%d",&q);
    while(q--){
        char s[5];
        int u,v;
        scanf("%s %d %d",s,&u,&v);
        if(s[0]=='+') work(u,v,2);
        else work(u,v,iv);
        printf("%d\n",sub(T.tr[1],1));
    }
    return 0;
}