#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    int n, m; cin >> n >> m;
    dsu d(n);
    vector<dsu> vd; rep(i, n)vd.push_back(d);
    rep(i, n-1){
        int u, v; cin >> u >> v;
        u--; v--;
        rep(j, i+1)vd[j].merge(u, v);
    }
    
    priority_queue<int, vector<int>, greater<int>> pq;
    rep(i, m){
        int s, t; cin >> s >> t;
        s--; t--;
        int left = 0, right = n-1;
        int mid;
        while(right-left > 1){
            mid = (left+right)/2;
            if(vd[mid].same(s, t)){
                left = mid;
            }else{
                right = mid;
            }
        }
        pq.push(left);
    }
    rep(i, n-1){
        while(!pq.empty() && pq.top() <= i)pq.pop();
        cout << pq.size() << endl;
    }

    return 0;
}