#include<bits/stdc++.h>
#include<atcoder/dsu>
using namespace std;

void solve(){
  int n,m;
  cin>>n>>m;
  vector<pair<int,int>> edge(n-1);
  for (int i=0;i<n-1;i++){
    int u,v;
    cin>>u>>v;
    u--;v--;
    edge[i]={u,v};
  }
  vector<pair<int,int>> st(m);
  for (int i=0;i<m;i++){
    int s,t;
    cin>>s>>t;
    s--;t--;
    st[i]={s,t};
  }
  vector<int> l(m,0),r(m,n-1);
  while (r[0]-l[0]>1){
    vector<vector<int>> idx(n);
    for (int i=0;i<m;i++){
      int mid=(r[i]+l[i])/2;
      idx[mid].push_back(i);
    }
    atcoder::dsu uf(n);
    for (int i=n-2;i>=0;i--){
      auto [u,v]=edge[i];
      uf.merge(u,v);
      for (int j:idx[i]){
        auto [s,t]=st[j];
        if (uf.same(s,t)) l[j]=i;
        else r[j]=i;
      }
    }
  }
  vector<int> sum(n);
  sum[0]=m;
  for (int i=0;i<m;i++) sum[r[i]]--;
  for (int i=0;i<n-1;i++) sum[i+1]+=sum[i];
  for (int k=1;k<=n-1;k++) cout<<sum[k]<<endl;
}

int main(){
  int t=1;
  //cin>>t;
  while (t--) solve();
}