#include using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int N; cin >> N; vector> Graph(N); for(int i=0; i> u >> v; u--; v--; Graph.at(u).push_back(v); Graph.at(v).push_back(u); } int M; cin >> M; vector V(N); for(int i=0; i> v; v--; V.at(v) = true; } int answer = 0; vector obake(N),kobake(N),minus1(N),minus2(N),minus3(N); auto dfs0 = [&](auto dfs0,int pos,int back) -> void { for(auto to : Graph.at(pos)) if(V.at(to)) obake.at(pos)++; if(V.at(pos)) obake.at(pos)++; if(obake.at(pos)) answer++; for(auto to : Graph.at(pos)){ if(to == back) continue; dfs0(dfs0,to,pos); if(V.at(to)) kobake.at(pos)++; if(obake.at(to) && kobake.at(to) == 0 && V.at(to) == false) minus1.at(pos)++; else if(obake.at(to) && kobake.at(to) == 0) minus2.at(pos)++; minus3.at(pos) += minus1.at(to); } }; dfs0(dfs0,0,-1); vector Answer(N); auto dfs = [&](auto dfs,int pos,int back) -> void { int now = answer-minus1.at(pos)-minus2.at(pos)-minus3.at(pos); if(obake.at(pos)) now--; Answer.at(pos) = now; for(auto to : Graph.at(pos)){ if(to == back) continue; minus3.at(pos) -= minus1.at(to); if(V.at(to)) kobake.at(pos)--; if(obake.at(pos) && kobake.at(pos) == 0 && V.at(pos) == false) minus1.at(to)++; else if(obake.at(pos) && kobake.at(pos) == 0) minus2.at(to)++; if(obake.at(to) && kobake.at(to) == 0 && V.at(to) == false) minus1.at(pos)--; if(V.at(pos)) kobake.at(to)++; minus3.at(to) += minus1.at(pos); dfs(dfs,to,pos); minus3.at(to) -= minus1.at(pos); if(V.at(pos)) kobake.at(to)--; if(obake.at(to) && kobake.at(to) == 0 && V.at(to) == false) minus1.at(pos)++; if(obake.at(pos) && kobake.at(pos) == 0 && V.at(pos) == false) minus1.at(to)--; else if(obake.at(pos) && kobake.at(pos) == 0) minus2.at(to)--; if(V.at(to)) kobake.at(pos)++; minus3.at(pos) += minus1.at(to); } }; dfs(dfs,0,-1); for(auto ans : Answer) cout << ans << endl; }