#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< typename T >
struct edge {
  int src, to;
  T cost;

  edge(int to, T cost) : src(-1), to(to), cost(cost) {}

  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

  edge &operator=(const int &x) {
    to = x;
    return *this;
  }

  operator int() const { return to; }
};

template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;

struct UnionFind {
  unordered_map< int, int > data;
  unordered_map< int, int > ver;
  vector< pair< int, int > > edges;
  int uku;

  UnionFind() : uku(0) {}


  bool unite(int x, int y) {

    if(!data.count(x)) data[x] = -1;
    if(!data.count(y)) data[y] = -1;

    edges.emplace_back(x, y);
    x = find(x), y = find(y);

    if(x == y) {
      uku -= min(size(x), ver[x]);
      ver[x] += 1;
      uku += min(size(x), ver[x]);
      return (false);
    }

    uku -= min(size(x), ver[x]);
    uku -= min(size(y), ver[y]);

    if(data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    ver[x] += ver[y] + 1;
    uku += min(size(x), ver[x]);
    return (true);
  }

  int find(int k) {
    if(data[k] < 0) return (k);
    int par = find(data[k]);
    // ver[par] += ver[k];
    data[k] = par;
    return par;
  }


  int size(int k) {
    return (-data[find(k)]);
  }
};


int main() {
  int N, K;
  cin >> N >> K;
  UnWeightedGraph g(N);
  for(int i = 1; i < N; i++) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    g[a].emplace_back(b);
    g[b].emplace_back(a);
  }
  vector< int > C(N), D(N);
  for(int i = 0; i < N; i++) {
    cin >> C[i] >> D[i];
    --C[i], --D[i];
  }
  vector< UnionFind > ufs(N);
  vector< int > ans(N);
  auto dfs = MFP([&](auto dfs, int idx, int par) -> void {
    ufs[idx] = UnionFind();

    for(auto &to : g[idx]) {
      if(to == par) continue;
      dfs(to, idx);
      if(ufs[idx].edges.size() < ufs[to].edges.size()) {
        swap(ufs[idx], ufs[to]);
      }
      for(auto &p : ufs[to].edges) {
        ufs[idx].unite(p.first, p.second);
      }
      ufs[to].data.clear();
      ufs[to].ver.clear();
      ufs[to].edges.clear();
    }
    ufs[idx].unite(C[idx], D[idx]);
    ans[idx] = ufs[idx].uku;
  });

  dfs(0, -1);


  for(auto &p : ans) cout << p << endl;
}


Measured memory_bytes: 79708