#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, m;
  cin >> n >> m;
  vector<P> es(n - 1);
  for (auto& [u, v] : es | views::reverse) cin >> u >> v, u--, v--;
  vector<P> st(m);
  for (auto& [s, t] : st) cin >> s >> t, s--, t--;
  VI r(m, n - 1), l(m, -1);
  while (true) {
    bool done = true;
    VVI ask(n - 1);
    rep(i, m) if (r[i] - l[i] > 1) {
      ask[(r[i] + l[i]) / 2].emplace_back(i);
      done = false;
    }
    if (done) break;
    dsu uf(n);
    rep(i, n - 1) {
      for (int iq : ask[i]) {
        auto [s, t] = st[iq];
        (uf.same(s, t) ? r[iq] : l[iq]) = i;
      }
      auto [u, v] = es[i];
      uf.merge(u, v);
    }
  }
  VI ans(n);
  rep(i, m) ans[n - 1 - r[i]]++;
  rrep(i, n - 1) ans[i] += ans[i+1];
  for (int i = 1; i < n; i++) cout << ans[i] << '\n';
}