/* ### # ############# # ####################### ################################ ######################################### ############################################## # ##################################### # ###### ############################ ###### ########### ################### # ########## ################ ######### ############### #################### # #################### ####### ############## ######################## ######## ######### ######################## ########### ####### ######################## ############## # ####### ######################## ######################## ######################## ######################## ######################## ######################## ######################## ###################### ####################### ################### ################### ############## ############### ########## ########## ###### ###### ## ## # # # # # # # # # # # #### #### #### #### #### # # # # # ## # # # # # # #____# ## # #/ # # ## # # # # # # # #^^^^ # ## ###/# # # # #### #### ###/# #### # # ## */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; namespace { using Integer = long long; //__int128; template istream& operator >> (istream& is, vector& vec){for(T& val: vec) is >> val; return is;} template istream& operator , (istream& is, T& val){ return is >> val;} template ostream& operator << (ostream& os, const vector& vec){for(int i=0; i ostream& operator , (ostream& os, const T& val){ return os << " " << val;} template void print(const H& head){ cout << head; } template void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); } template void println(const T& ... values){ print(values...); cout << endl; } template void eprint(const H& head){ cerr << head; } template void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); } template void eprintln(const T& ... values){ eprint(values...); cerr << endl; } class range{ long long start_, end_, step_; public: struct range_iterator{ long long val, step_; range_iterator(long long v, long long step) : val(v), step_(step) {} long long operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(long long len) : start_(0), end_(len), step_(1) {} range(long long start, long long end) : start_(start), end_(end), step_(1) {} range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } }; string operator "" _s (const char* str, size_t size){ return move(string(str)); } constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);} constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);} constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); } inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed mt19937 mt(chrono::duration_cast(chrono::steady_clock::now().time_since_epoch()).count()); template string join(const vector& v, const string& sep){ stringstream ss; for(int i=0; i0) ss << sep; ss << v[i]; } return ss.str(); } string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; } } template class SparseTable{ public: SparseTable(vector& vec, T default_value_, function eval) : col(vec.size()), default_value(default_value_) { evaluate = eval; row = 1; while((1<>(row, vector(col)); set(vec); } void set(vector& vec){ assert(col == vec.size()); values = &vec; vector& val = vec; iota(table[0].begin(), table[0].end(), 0); for(int k=1; k=r) return default_value; vector& val = *values; T ret = default_value; int k = 0; while((1<<(k+1)) < (r-l)) k++; auto left = val[ table[k][l] ]; auto right = val[ table[k][r-(1<* values; vector> table; function evaluate; }; int main(){ int n; scanf("%d", &n); vector> G(n+1); G[0].push_back(1); G[1].push_back(0); for(int _ : range(n-1)){ int u,v; scanf("%d%d", &u, &v); G[u].push_back(v); G[v].push_back(u); } vector parent(n+1, 0); vector depth (n+1, 0); vector a(n+1, 0); vector> b; function EulerTour = [&](int pos, int last){ parent[pos] = last; depth[pos] = depth[last] + 1; a[pos] = b.size(); b.push_back({depth[pos], pos}); for(int nx : G[pos]){ if(nx == last) continue; EulerTour(nx, pos); b.push_back({depth[pos], pos}); } }; EulerTour(1, 0); SparseTable< pair > t(b, {8_ten, 8_ten}, [&](pair a, pair b){return a s(n+1, 0); vector> d( *max_element(depth.begin(), depth.end()) + 1 ); for(int v : range(1, n+1)){ d[ depth[v] ].push_back( v ); } int q; scanf("%d", &q); while(q--){ int u,v; scanf("%d%d", &u, &v); int p = t.get( min(a[u], a[v]), max(a[u], a[v]) ).second; s[u]++; s[v]++; s[p]--; s[ parent[p] ]--; } long long ans = 0; for(int dd=d.size()-1; dd>0; dd--){ for(int v : d[dd]){ ans += s[v] * (s[v] + 1) / 2; s[ parent[v] ] += s[v]; } } println(ans); return 0; }