// #include <bits/stdc++.h> #include <iostream> #include <cmath> #include <algorithm> #include <map> #include <unordered_map> #include <vector> #include <iomanip> #include <string> #include <queue> #include <set> #include <deque> using namespace std; #define int long long #define endl "\n" #define fi first #define se second const int M=1203465797; const int inf = 1e14; const int LOG=18; const int N=1e3+5; int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r; map<pair<int,int>,pair<int,int>>ed; vector<int>a[N]; int ans[N]; multiset<pair<int,int>>s; void dfs(int x,int y){ int v=0; int h=-1; for (auto [l,r]:s){ if (h>=l and h<=r){ v+=r-h; h=r; } else if(h>r){ continue; } else{ ans[x]+=v; v=r-l+1; h=r; } } ans[x]+=v; for (int i:a[x]){ if (i==y)continue; s.insert(ed[{i,x}]); dfs(i,x); s.erase(s.find(ed[{i,x}])); } } void solve(){ cin >> n >> m; for (int i=0;i<n-1;i++){ cin >> x >> y; a[x].push_back(y); a[y].push_back(x); cin >> l >> r; ed[{x,y}]={l,r}; ed[{y,x}]={l,r}; } dfs(1,0); for (int i=2;i<=n;i++){ cout << ans[i] << endl; } } signed main() { ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE cout << fixed << setprecision(9); srand(time(0)); // int t=1; // cin >> t; for (int _=1;_<=t;_++){ solve(); q++; } }