#include<bits/stdc++.h> // #include<atcoder/modint> // #include<atcoder/convolution> #define pb push_back #define eb emplace_back #define mp make_pair #define F first #define S second #define rs resize #define ft front() #define bk back() #define int long long #define vi vector<int> #define vvi vector<vector<int>> #define pii pair<int, int> #define vpii vector<pair<int, int>> #define vc vector<char> #define vb vector<bool> #define mii map<int,int> #define f0r(i,n) for(int i=0;i<n;i++) #define FOR(i,k,n) for(int i=k;i<n;i++) #define r0f(i,n) for(int i = n-1; i >= 0; i--) #define R0F(i,k,n) for(int i = n-1; i >= k; i--) #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define SUM(v) (accumulate(all(v), 0LL)) #define in(a) int a; cin>>a #define in2(a,b) int a,b; cin>>a>>b #define in3(a,b,c) int a,b,c; cin>>a>>b>>c #define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d #define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];} #define out(a) cout<<a<<'\n' #define out2(a,b) cout<<a<<' '<<b<<'\n' #define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n' #define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n' #define pout(a) cout<<a.first<<' '<<a.second<<'\n' #define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl #define dout(a) cout<<a<<' '<<#a<<endl #define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl #define YN(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';} #define yn(x); if(x){cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';} #define p2(x) (1LL << (x)) #define pct(x) (__builtin_popcountll((x))) #define ist(x,y) (((x) >> (y)) & 1) template<class T, class U> bool ckmin(T& a, const U& b) { return (T)b < a ? a = (T)b, 1 : 0; } template<class T, class U> bool ckmax(T& a, const U& b) { return a < (T)b ? a = (T)b, 1 : 0; } const int leg = 1e9 + 7; const int mod = 998244353; using namespace std; // using namespace atcoder; // using mint = modint998244353; // using mint = modint1000000007; const int mxn = 1e5 + 5, lg = 18, B = 300; // mint fact[mxn], inv[mxn]; // mint C(int n, int r){return fact[n] * inv[n-r] * inv[r];} // mint snb(int n, int r){return C(n + r, n);} struct query{ int l, r, t; }; struct roll{ int a,b,c; }; vi adj[mxn]; int dfn[mxn], par[mxn], dep[mxn], st[mxn*2][lg], tin[mxn], lo[mxn*2], pv[mxn], nx[mxn], c[mxn], iv[mxn], inv[mxn]; int timer = 0, timer2 = 0, L, R, cnt[mxn], cur = 0; vi et; vector<roll> rb; bool operator<(const query &a, const query &b){ if(a.l/B!=b.l/B)return a.l/B<b.l/B; else return a.r>b.r; } int quer(int l, int r){ int k = lo[r-l+1]; return min(st[l][k], st[r-p2(k)+1][k]); } void dfs(int node, int from){ par[node]=from; dfn[node]=timer++; tin[node]=timer2++; et.pb(node); for(auto u : adj[node])if(u!=from)dep[u]=dep[node]+1,dfs(u,node),timer2++,et.pb(node); } int dist(int x, int y){ // dout2(x,y); // dout2(dep[inv[x]],dep[inv[y]]); dout(quer(iv[x],iv[y])); dout2(iv[x],iv[y]); if(iv[x] > iv[y])swap(x,y); //dout2(iv[x],iv[y]);dout(quer(iv[x],iv[y])); return dep[inv[x]]+dep[inv[y]]-2*quer(iv[x],iv[y]); // if(dep[x] > dep[y])swap(x,y); int dif = dep[y] - dep[x], ans = 0; f0r(i,lg)if((1<<i) & dif)y = up[y][i], ans += (1<<i); // if(x==y)return ans; for(int i = lg-1; i >= 0; i--){ // if(up[x][i] != up[y][i])ans += (1<<(i+1)), x=up[x][i], y = up[y][i]; // } return ans + 2; } void del(int x, bool flag){ cnt[x]--; if(cnt[x]==0){ cur -= dist(x,pv[x]) + dist(x,nx[x]); nx[pv[x]]=nx[x]; pv[nx[x]]=pv[x]; cur += dist(pv[x], nx[x]); } if(flag)rb.pb({pv[x],nx[x],x}); } signed main(){ ios::sync_with_stdio(false); cin.tie(NULL); //ifstream cin(".in"); //ofstream cout(".out"); // fact[0]=1;FOR(i,1,mxn)fact[i]=fact[i-1]*i;inv[mxn-1]=fact[mxn-1].inv();r0f(i,mxn-1)inv[i]=inv[i+1]*(i+1); in3(n,m,q); f0r(i,n-1){in2(a,b);a--;b--;adj[a].pb(b);adj[b].pb(a);} dfs(0,-1); f0r(i,et.size())st[i][0]=dep[et[i]]; FOR(j,1,lg)for(int i = 0; i + p2(j) - 1 < et.size(); i++){ st[i][j]=min(st[i][j-1],st[i+p2(j-1)][j-1]); } lo[1]=0; FOR(i,2,et.size()+1){ lo[i]=lo[i>>1]+1; } //vout(et); // f0r(i,n)cout<<tin[i]<<' '; cout<<'\n'; vout(et); dout(quer(2,4)); // f0r(i,n)cout<<dfn[i]<<' '; cout<<'\n'; f0r(i,m)cin>>c[i], c[i]--, c[i]=dfn[c[i]]; vector<query>quers; f0r(i,q){in2(l,r); l--; r--; quers.pb({l,r,i});} f0r(i,n)iv[dfn[i]]=tin[i], inv[dfn[i]]=i; vi ans(quers.size()); sort(all(quers)); f0r(tt,quers.size()){ auto [l,r,t] = quers[tt]; if(tt==0 || l/B != quers[tt-1].l/B){ L = l/B*B; R=m-1; f0r(i,n)cnt[i]=0,pv[i]=-1,nx[i]=-1; int mn = 4e18, mx = -4e18; FOR(i,L,R+1)cnt[c[i]]++, ckmin(mn, c[i]), ckmax(mx, c[i]); cur = 0; int prev = -1; f0r(i,n){if(cnt[i]>0){pv[i]=prev, prev=i; if(pv[i]!=-1)cur+=dist(i,pv[i]);}} prev=-1; for(int i = n-1; i >= 0; i--){if(cnt[i]>0)nx[i]=prev, prev=i;} nx[mx] = mn, pv[mn] = mx; cur+=dist(mn,mx); } //dout(cur); // if(r/B*B == l/B*B){ // int tmp = 0; vi idk; FOR(i,l,r){tmp+=dist(c[i], c[i+1]); dout2(c[i],c[i+1]); dout(dist(c[i],c[i+1]));} tmp+=dist(c[l],c[r]); dout(tmp); ans[t]=tmp/2+1; continue; // } // dout2(l,r); while(R > r){ del(c[R], 0); R--; } //dout(cur); int tmp = cur; while(L < l){del(c[L], 1), L++;} ans[t]=cur/2+1; L=l/B*B; while(!rb.empty()){auto [a,b,c] = rb.back(); rb.pop_back(); if(cnt[c]==0)nx[a]=c, pv[b]=c; cnt[c]++;} cur = tmp; } for(auto u : ans)cout<<u<<'\n'; /* vi c(m); f0r(i,m)cin>>c[i], c[i]--; while(q--){ in2(l,r); l--; r--; if(l==r){out(1); continue;} int ans = 0; vpii v; FOR(i,l,r+1)v.eb(dfn[c[i]],c[i]); sort(all(v)); f0r(i,v.size()-1){ ans += dist(v[i].S, v[i+1].S); } ans += dist(v[0].S, v.back().S); ans /= 2; ans++; out(ans); } */ }