import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }



int N;
int[] A, B;
int K;
int[] V;

int[][] graph;
int[] par;
void dfs(int u, int p) {
  par[u] = p;
  foreach (v; graph[u]) if (p != v) {
    dfs(v, u);
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      A = new int[N - 1];
      B = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
      }
      K = readInt;
      V = new int[K];
      foreach (k; 0 .. K) {
        V[k] = readInt - 1;
      }
      
      graph = new int[][N];
      foreach (i; 0 .. N - 1) {
        graph[A[i]] ~= B[i];
        graph[B[i]] ~= A[i];
      }
      par = new int[N];
      dfs(0, -1);
      
      auto ghost = new int[N];
      auto damage = new int[N];
      foreach (u; V) {
        ghost[u] = 1;
        ++damage[u];
        foreach (v; graph[u]) {
          ++damage[v];
        }
      }
      auto cnt1 = new int[N];
      foreach (u; 1 .. N) if (damage[u] == 1) {
        ++cnt1[par[u]];
      }
      
      const base = cast(int)(damage.count!"a");
      auto ans = new int[N];
      foreach (u; 0 .. N) {
        const p = par[u];
        int[3] score;
        // dist = 0
        if (damage[u]) ++score[0];
        // dist = 1
        if (~p && damage[p] <= ghost[u] + ghost[p]) ++score[1];
        foreach (v; graph[u]) if (p != v) {
          if (damage[v] <= ghost[u] + ghost[v]) ++score[1];
        }
        // dist = 2
        if (~p && ghost[p]) {
          if (~par[p] && damage[par[p]] == 1) ++score[2];
          score[2] += (cnt1[par[u]] - (damage[u] == 1));
        }
        foreach (v; graph[u]) if (p != v) {
          if (ghost[v]) {
            score[2] += cnt1[v];
          }
        }
        debug {
          writeln(u, ": ", score);
        }
        ans[u] = base - score[0] - score[1] - score[2];
      }
      
      foreach (u; 0 .. N) {
        writeln(ans[u]);
      }
    }
  } catch (EOFException e) {
  }
}