#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 1000000007; const ll INF = mod * mod; typedef pairP; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; typedef double ld; typedef pair LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); ll mod_pow(ll x, ll n, ll m) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 22; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } ll gcd(ll a, ll b) { if (a < b)swap(a, b); while (b) { ll r = a % b; a = b; b = r; } return a; } ll s[1 << 18]; ll c[1 << 18]; struct SegT { private: int n; vector node,coef,lazy; public: SegT(vector v) { int sz = v.size(); n = 1; while (n < sz)n <<= 1; node.resize(2 * n - 1, 0); coef.resize(2 * n - 1, 0); lazy.resize(2 * n - 1, 0); rep(i, sz) { node[i + n - 1] = s[v[i]]; coef[i + n - 1] = c[v[i]]; } per(i, n - 1) { node[i] = node[2 * i + 1] + node[2 * i + 2]; coef[i] = coef[2 * i + 1] + coef[2 * i + 2]; } } void eval(int k, int l, int r) { node[k] += coef[k]*lazy[k]; if (r - l > 1) { lazy[2 * k + 1] += lazy[k]; lazy[2 * k + 2] += lazy[k]; } lazy[k] = 0; } void add(ll x, int a, int b, int k = 0, int l = 0, int r = -1) { if (r < 0)r = n; eval(k, l, r); if (r <= a || b <= l)return; if (a <= l && r <= b) { lazy[k] += x; eval(k, l, r); } else { add(x, a, b, k * 2 + 1, l, (l + r) / 2); add(x, a, b, k * 2 + 2, (l + r) / 2, r); node[k] = node[k * 2 + 1]+node[k * 2 + 2]; } } modint query(int a, int b, int k = 0, int l = 0, int r = -1) { if (r < 0)r = n; eval(k, l, r); if (r <= a || b <= l)return 0; if (a <= l && r <= b)return node[k]; else { modint vl = query(a, b, k * 2 + 1, l, (l + r) / 2); modint vr = query(a, b, k * 2 + 2, (l + r) / 2, r); return vl+vr; } } }; struct edge { int to; }; using edges = vector; using Graph = vector; struct HLDecomposition { struct Chain { int depth; P parent;//chain number,index vector

child;//child chain number,parent index vector mapfrom; SegT stree; //Chain() { ; } Chain(vector seq) :stree(seq) { ; } }; Graph baseG; vector chains; vector

mapto;//raw index->chain number &index vector> mapfrom;//chain number & index ->raw index HLDecomposition() { ; } HLDecomposition(const Graph& g) { baseG = g; const int n = baseG.size(); mapto = vector

(n, P{ -1,-1 }); mapfrom.clear(); vector sz(n, 0); int start = -1; rep(i, n)if (baseG[i].size() <= 1) { start = i; break; } //assert(start != -1); size_check_bfs(start, sz); decomposition(start, start, 0, 0, 0, sz); } int depth(int t) { return chains[mapto[t].first].depth; } private: void size_check_bfs(int start, vector& sz) { const int n = baseG.size(); queue

que; que.push({ start,start }); int cnt = 0; vector ord(n, -1); while (!que.empty()) { int from, parent; tie(from, parent) = que.front(); que.pop(); ord[cnt++] = from; for (edge e : baseG[from]) { if (e.to == parent)continue; que.push({ e.to,from }); } } //assert(cnt == n); reverse(all(ord)); rep(i, n) { int from = ord[i]; sz[from] = 1; for (edge e : baseG[from])sz[from] += sz[e.to]; } } int decomposition(int from, int parent, int depth, int pnumber, int pindex, const vector& sz) { vector seq; bfs(from, parent, seq, sz); const int c = chains.size(); chains.push_back(Chain(seq)); //chains.push_back(Chain()); chains[c].depth = depth; chains[c].parent = { pnumber,pindex }; rep(i, seq.size()) { mapto[seq[i]] = { c,i }; chains[c].mapfrom.push_back(seq[i]); } mapfrom.push_back(chains[c].mapfrom); rep(i, seq.size()) { for (edge e : baseG[seq[i]]) { if (mapto[e.to].first != -1)continue; int nc = decomposition(e.to, seq[i], depth + 1, c, i, sz); chains[c].child.push_back({ nc,i }); } } return c; } void bfs(int from, int parent, vector& seq, const vector& sz) { for (;;) { seq.push_back(from); int best = -1, next = -1; for (edge e : baseG[from]) { if (e.to == parent)continue; if (best < sz[e.to]) { best = sz[e.to]; next = e.to; } } if (next == -1)break; parent = from; from = next; } } vector> all_edge(int u, int v) { vector> res; if (depth(u) > depth(v))swap(u, v); while (depth(v) > depth(u)) { res.push_back({ mapto[v].first,{ 0,mapto[v].second + 1 } }); P par = chains[mapto[v].first].parent; v = mapfrom[par.first][par.second]; } while (mapto[v].first != mapto[u].first) { res.push_back({ mapto[v].first,{ 0,mapto[v].second + 1 } }); P par = chains[mapto[v].first].parent; v = mapfrom[par.first][par.second]; res.push_back({ mapto[u].first,{ 0,mapto[u].second + 1 } }); par = chains[mapto[u].first].parent; u = mapfrom[par.first][par.second]; } P p = minmax(mapto[v].second, mapto[u].second); res.push_back({ mapto[v].first,{ p.first + 1,p.second + 1 } }); return res; } vector> all_vertice(int u, int v) { vector> res; if (depth(u) > depth(v))swap(u, v); while (depth(v) > depth(u)) { res.push_back({ mapto[v].first,{ 0,mapto[v].second + 1 } }); P par = chains[mapto[v].first].parent; v = mapfrom[par.first][par.second]; } while (mapto[v].first != mapto[u].first) { res.push_back({ mapto[v].first,{ 0,mapto[v].second + 1 } }); P par = chains[mapto[v].first].parent; v = mapfrom[par.first][par.second]; res.push_back({ mapto[u].first,{ 0,mapto[u].second + 1 } }); par = chains[mapto[u].first].parent; u = mapfrom[par.first][par.second]; } P p = minmax(mapto[v].second, mapto[u].second); res.push_back({ mapto[v].first,{ p.first,p.second + 1 } }); return res; } public: void edge_add(int u, int v, int a) { vector> es = all_edge(u, v); rep(i, es.size()) { int id = es[i].first; int l = es[i].second.first; int r = es[i].second.second; chains[id].stree.add(a, l, r); } } ll edge_sum(int u, int v) { vector> es = all_edge(u, v); ll res = 0; rep(i, es.size()) { int id = es[i].first; int l = es[i].second.first; int r = es[i].second.second; res += chains[id].stree.query(l, r); } return res; } void vertice_add(int u, int v, int a) { vector> vs = all_vertice(u, v); rep(i, vs.size()) { int id = vs[i].first; int l = vs[i].second.first; int r = vs[i].second.second; chains[id].stree.add(a, l, r); } } modint vertice_sum(int u, int v) { vector> vs = all_vertice(u, v); modint res = 0; rep(i, vs.size()) { int id = vs[i].first; int l = vs[i].second.first; int r = vs[i].second.second; res += chains[id].stree.query(l, r); } return res; } }; void solve() { int n; cin >> n; rep(i, n)cin >> s[i]; rep(i, n)cin >> c[i]; Graph g(n); rep(i, n - 1) { int a, b; cin >> a >> b; a--; b--; g[a].push_back({ b }); g[b].push_back({ a }); } HLDecomposition hld(g); int q; cin >> q; rep(aa, q) { int t; cin >> t; if (t == 0) { int x, y, z; cin >> x >> y >> z; x--; y--; hld.vertice_add(x, y, z); } else { int x, y; cin >> x >> y; x--; y--; modint ans = hld.vertice_sum(x, y); cout << ans << "\n"; } } } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init_f(); //expr(); //int t; cin >> t; rep(i, t) //while (cin >> n >> m>>s1>>s2>>t, n) solve(); return 0; }