#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const int maxm = 200005;
const int inf = 1e9 + 7;
vector<int> hav[maxn];
int st[maxn], en[maxn], tot, cnt, ans[maxn];
int n, m, head[maxn], to[maxm], nex[maxm];
int sum[maxn << 3], laz[maxn << 3];
void push_up(int l, int r, int rt) {
  if (laz[rt])
    sum[rt] = r - l + 1;
  else {
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
  }
}
void update(int l, int r, int rt, int ql, int qr, int v) {
  if (ql <= l && r <= qr) {
    laz[rt] += v;
    push_up(l, r, rt);
    return;
  }
  if (ql <= (l + r) / 2) update(l, (l + r) / 2, rt << 1, ql, qr, v);
  if (qr > (l + r) / 2) update((l + r) / 2 + 1, r, rt << 1 | 1, ql, qr, v);
  push_up(l, r, rt);
}
void add(int u, int v) {
  to[cnt] = v;
  nex[cnt] = head[u];
  head[u] = cnt++;
}
void init(int u, int f) {
  st[u] = ++tot;
  for (int i = head[u]; ~i; i = nex[i]) {
    int v = to[i];
    if (v == f) continue;
    init(v, u);
  }
  en[u] = tot;
}
void dfs(int u, int f) {
  for (auto x : hav[u]) {
    update(1, tot, 1, st[x], en[x], 1);
  }
  ans[u] = max(sum[1] - 1, 0);
  for (int i = head[u]; ~i; i = nex[i]) {
    int v = to[i];
    if (f == v) continue;
    dfs(v, u);
  }
  for (auto x : hav[u]) {
    update(1, tot, 1, st[x], en[x], -1);
  }
}
int main() {
  memset(head, -1, sizeof(head));
  scanf("%d%d", &n, &m);
  for (int i = (int)2; i <= (int)n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    add(x, y);
    add(y, x);
  }
  for (int i = (int)1; i <= (int)m; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    hav[a].push_back(a);
    hav[b].push_back(a);
    hav[a].push_back(b);
    hav[b].push_back(b);
  }
  init(1, -1);
  dfs(1, -1);
  for (int i = (int)1; i <= (int)n; i++) {
    printf("%d%c", ans[i], i == n ? '\n' : ' ');
  }
  return 0;
}
