#include <bits/stdc++.h>
using std::bitset;
using std::cout;
using std::deque;
using std::endl;
using std::greater;
using std::lower_bound;
using std::make_pair;
using std::map;
using std::max;
using std::min;
using std::multimap;
using std::multiset;
using std::nth_element;
using std::pair;
using std::priority_queue;
using std::queue;
using std::reverse; 
using std::set;
using std::sort;
using std::sqrt;
using std::stable_sort;
using std::string;
using std::swap;
using std::unique;
using std::upper_bound;
using std::vector;
typedef long long li;
typedef long double lf;

inline li read(){
	li ans = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9'){
		f = (ch == '-') ? -1 : 1;
		ch = getchar();
	}
	while(ch <= '9' && ch >= '0'){
		ans = ans * 10 + (ch ^ 48);
		ch = getchar();
	}
	return ans * f;
} 

vector<li> a[100010];
li kind, n, T;
const li mod = 998244353;

namespace bf{
	li dep[100010], f[5010][5010];
	li L[100010], R[100010], h[100010];
	li F[100010][23], lg[100010];
	vector<pair<li, li>> v[100010];
//	queue<pair<li, li>> q;
	std::unordered_map<li, li> mp;
	
	priority_queue<pair<li, li>, vector<pair<li, li>>, greater<pair<li, li>>> q;
	
	void dfs(li u, li fa){
		dep[u] = dep[fa] + 1;
		F[u][0] = fa;
		for(li i = 1; i <= lg[n]; i++) F[u][i] = F[F[u][i - 1]][i - 1];
		for(li v : a[u]){
			if(v == fa) continue;
			dfs(v, u);
		}
	}
	
	li ans[200010];
	void dfs2(li u, li root, li limit){
//		cout << u << " " << limit << endl;
		if(u == 1){
			ans[root]++;
			return;
		}
		for(li v : a[u]){
			dfs2(v, root, min(limit, dep[v] - h[v]));
		}
		li tx = u, ty = 0;
		while(tx != 1){
			tx = F[tx][0], ty++;
			if(L[u] <= ty && ty <= R[u]){
				if(dep[tx] < limit){
					dfs2(tx, root, min(limit, dep[tx] - h[tx]));
				}
			}
		}
	}
	
	void work(){
//		lg[0] = -1;
//		for(li i = 1; i <= 100000; i++) lg[i] = lg[i >> 1] + 1;
		T = read();
		while(T--){
			n = read();
//			while(q.size()) q.pop();
			for(li i = 1; i <= n; i++) a[i].clear();
			for(li i = 2; i <= n; i++){
				li p = read();
				a[p].push_back(i);
				L[i] = read(), R[i] = read(), h[i] = read();
			}
			dep[0] = -1;
			dfs(1, 0);
			for(li i = 2; i <= n; i++){
				ans[i] = 0;
				dfs2(i, i, n + 1);
				printf("%lld ", ans[i]);
			}
			puts("");
//			for(li i = 1; i <= n; i++) for(li j = 0; j <= n; j++) f[i][j] = 0;
////			for(li i = 2; i <= n; i++){
////				if(a[i].size() == 0){
////					f[i][dep[i] - h[i]] = 1;
////					q.push({dep[i] - h[i], i});
////				}
////			}
//			for(li i = 2; i <= n; i++){
//				li ty = 0, tx = i;
//				while(tx != 1){
//					tx = F[tx][0], ty++;
//					if(L[i] <= ty && ty <= R[i]){
//						v[tx].push_back({i, 1});
//						printf("%lld %lld\n", tx, i);
//					}
//				}
//				v[i].push_back({F[i][0], 0});
//			}
//			f[1][n] = 1;
//			q.push({n, 1});
//			while(!q.empty()){
//				li y = q.top().first, x = q.top().second; q.pop();
//				cout << "f " << x << " " << y << " = " << f[x][y] << endl;
//				mp[x * 100000 + y] = 0;
//				for(auto temp : v[x]){
////					cout << tx << endl;
//					li tx = temp.first;
//					cout <<"x = " << x <<"tx =  "<< tx << endl;
//					cout <<dep[tx] - h[tx] <<" " << y << " " <<temp.second <<endl;
//					if(temp.second && dep[x] - h[x] >= y) continue;
//					li ny = min(y, dep[tx] - h[tx]);
////					if(dep[x] < dep[tx]) 
////					if(temp.second) ny = max(ny, dep[tx]); 
//					f[tx][ny] += f[x][y];
//					printf("f %lld %lld upd %lld %lld\n", x, y, tx, ny);
//					if(!mp[tx * 100000 + ny]){
//						mp[tx * 100000 + ny] = 1;
//						q.push({ny, tx});
//					}
//				}
//			}
//			li ans = 0;
//			for(li i = 2; i <= n; i++){
//				ans = 0;
//				for(li j = 0; j <= n; j++){
//					ans += f[i][j];
//					if(ans >= mod) ans -= mod;
//				}
//				printf("%lld ", ans);
//			}
//			puts("");
//			mp.clear();
		}
		exit(0);
	}
}

int main(){
//	freopen("wonderful.ans", "r", stdin);
//	freopen("www.ww", "w", stdout);
	kind = read();
	bf::work();
	return 0;
}