#include <bits/stdc++.h>
#define ff(i,a,b) for(int i=(a), _b=(b); i <= _b; ++i)
#define gg(i,a,b) for(int i=(a), _b=(b); i >= _b; --i)
#define REP(i ,b) for(int i=(0), _b=(b); i < _b; ++i)
#define long long long
#define ALL(v) v.begin(), v.end()
#define endl '\n'
#define Love(a) {cerr << #a << " = " << a << endl;}
#define _ << " , " <<
#define X first
#define Y second
#define gc getchar
#define pc putchar
#define NAME "spy"
using namespace std;
const int N = 2007;
int n, Q, rootA, rootB, cnt[N], pb[N], ans[N];
vector <int> a[N], b[N], c[N];
inline void read(int &x)
{
register int c = gc();
x = 0;
int neg = 0;
for (;((c<48 || c>57) && c != '-') ;c = gc());
if(c=='-') {neg=1;c=gc();}
for(;c>47 && c<58;c = gc()) {x = (x<<1) + (x<<3) + c - 48;}
if(neg) x=-x;
}
inline void writeln(int x){
char buffor[21];
register int i=0;
int neg=0; if (x<0) {neg=1; x= -x;}
do{
buffor[i++]=(x%10)+'0';
x/=10;
} while(x);
i--;
if (neg) pc('-');
while(i>=0) pc(buffor[i--]);
pc('\n');
}
void Enter() {
read(n);
read(Q);
ff(i, 1, n) {
int p1, p2;
read(p1);
read(p2);
if (p1 == 0) rootA = i;
if (p2 == 0) rootB = i;
a[p1].push_back(i);
b[p2].push_back(i);
}
ff(i, 1, Q) {
int r, b;
read(r);
read(b);
c[r].push_back(b);
}
}
void DFSB(int u) {
for (int v : b[u]) {
pb[v] = u;
DFSB(v);
}
}
void DFSA(int u) {
for (int x : c[u]) cnt[x]++;
for (int i = u; i; i = pb[i]) ans[u] += cnt[i];
for (int v : a[u]) DFSA(v);
for (int x : c[u]) cnt[x]--;
}
void Process() {
DFSB(rootB);
DFSA(rootA);
ff(i, 1, n) writeln(ans[i]);
}
int main() {
//ios_base::sync_with_stdio(0); cin.tie(0);
//freopen(NAME".inp", "r", stdin);
//freopen(NAME".out", "w", stdout);
Enter();
Process();
return 0;
}
