#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VVI to(n);
  rep(i, n - 1) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    to[u].emplace_back(v);
    to[v].emplace_back(u);
  }
  vector<char> exists(n);
  int m;
  cin >> m;
  rep(i, m) {
    int x;
    cin >> x;
    exists[x-1] = true;
  }
  VI d(n);
  rep(u, n) if (exists[u]) {
    d[u]++;
    for (int v : to[u]) d[v]++;
  }
  VI c1(n);
  rep(u, n) if (exists[u]) {
    for (int v : to[u]) c1[u] += d[v] == 1;
  }
  int cur = 0;
  rep(i, n) cur += d[i] > 0;
  rep(u, n) {
    int res = cur;
    if (d[u]) res--;
    for (int v : to[u]) if (d[v]) {
      int now = d[v] - exists[u] - exists[v];
      res -= !now;
      if (exists[v]) res -= c1[v] - (d[u] == 1);
    }
    cout << res << '\n';
  }
}