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

class UnionFind{
    private:
    int ok = 0;
    vector<int> par,siz;
    vector<set<int>> S;

    public:
    UnionFind(int N,const vector<pair<int,int>> &ST){
        par.resize(N,-1);
        siz.resize(N,1);
        S.resize(N);
        ok = 0;
        for(int i=0; i<ST.size(); i++){
            auto [s,t] = ST.at(i);
            S.at(s).insert(i);
            S.at(t).insert(i);
        }
    }
 
    int root(int x){ //連結成分の代表頂点を返す.
        if(par.at(x) == -1) return x;
        else return par.at(x) = root(par.at(x));
    }
    bool unite(int u, int v){ //u,vを連結する 連結してた->false,した->trueを返す.
        u = root(u),v = root(v);
        if(u == v) return false;
 
        if(S.at(u).size() < S.at(v).size()) swap(u,v); //Union by size.
        par.at(v) = u;
        siz.at(u) += siz.at(v);
        for(auto p : S.at(v)){
            if(S.at(u).count(p)) ok++,S.at(u).erase(p);
            else S.at(u).insert(p);
        }
        return true;
    }
    bool issame(int u, int v){ //同じ連結成分ならtrue.
        if(root(u) == root(v)) return true;
        else return false;
    }
    int size(int pos){return siz.at(root(pos));} //posの連結成分の大きさを返す.
    int query(){return ok;}
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,M; cin >> N >> M;
    vector<pair<int,int>> edge(N-1),ST(M);
    for(auto &[u,v] : edge) cin >> u >> v,u--,v--;
    for(auto &[u,v] : ST) cin >> u >> v,u--,v--;

    UnionFind Z(N,ST);
    vector<int> answer = {0};
    for(int i=N-2; i>0; i--){
        auto [u,v] = edge.at(i);
        Z.unite(u,v);
        answer.push_back(Z.query());
    }

    while(answer.size()) cout << answer.back() << "\n",answer.pop_back();
}