영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given a tree consisting of n nodes, and m paths in the tree.
Your task is to calculate for each node the number of paths containing that node.
Input
The first input line contains integers n and m: the number of nodes and paths. The nodes are numbered 1,2,…,n.
Then there are n-1 lines describing the edges. Each line contains two integers a and b: there is an edge between nodes a and b.
Finally, there are m lines describing the paths. Each line contains two integers a and b: there is a path between nodes a and b.
Output
Print n integers: for each node 1,2,…,n, the number of paths containing that node.
Constraints
- 1 ≤ n, m ≤ 2 · 10^5
- 1 ≤ a,b ≤ n
예제
예제 1
5 3 1 2 1 3 3 4 3 5 1 3 2 5 1 4
3 1 3 1 1