hdu 5044

#pragma comment(linker, "/STACK:102400000,102400000")
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define foreach(c,itr)  for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define pf              push_front
#define X               first
#define Y               second
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define MC(a,b)        memcpy(a,b,sizeof(b))
#define MAX(a,b)        ((a)>(b)?(a):(b))
#define MIN(a,b)        ((a)<(b)?(a):(b))
#define read            freopen("out.txt","r",stdin)
#define write           freopen("out2.txt","w",stdout)

const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 100111;
const int maxs = 20;

struct Node{
	int to;
	int id;
	int next;
}node[maxn * 2];

int use;
int head[maxn];
i64 e[maxn];
i64 ex[maxn];
i64 a[maxn];
int n, m;
int dfv[maxn * 2];
int dfn[maxn];
int sv[maxs][maxn * 2];
int level[maxn];
int lg[maxn * 2];
int t[maxn];

int df;
bool vis[maxn];
void dfs(int now, int step = 0){
	dfn[now] = df;
	vis[now] = true;
	level[now] = step;
	dfv[df++] = now;
	int to;
	for (int i = head[now]; i != -1; i = node[i].next){
		to = node[i].to;
		if (!vis[to]){
			t[to] = now;
			dfs(to, step + 1);
			dfv[df++] = now;
		}
	}
}

int lca(int x, int y){
	x = dfn[x];
	y = dfn[y];
	if (x > y){
		swap(x, y);
	}
	if (level[sv[lg[y - x + 1]][x]] < level[sv[lg[y - x + 1]][y - (1 << lg[y - x + 1]) + 1]]){
		return sv[lg[y - x + 1]][x];
	}
	else{
		return sv[lg[y - x + 1]][y - (1 << lg[y - x + 1]) + 1];
	}
}

void init(){
	for (int i = 0; i<maxs; i++){
		if ((1 << i) < maxn*2) {
			lg[1 << i] = i;
		}
	}
	for (int i = 3; i < maxn * 2; i++){
		if (lg[i] == 0){
			lg[i] = lg[i - 1];
		}
	}
}

void start(){
	df = 1;
	for (int i = 0; i <= n; i++){
		vis[i] = false;
	}
	dfs(1);
	df--;
	for (int i = 1; i <= df; i++){
		sv[0][i] = dfv[i];
	}
	for (int step = 1; (1 << step) <= df; step++){
		for (int x = 1; x <= df; x++){
			if (x + (1 << step) <= df && level[sv[step - 1][x + (1 << (step - 1))]] < level[sv[step - 1][x]]){
				sv[step][x] = sv[step - 1][x + (1 << (step - 1))];
			}
			else{
				sv[step][x] = sv[step - 1][x];
			}
		}
	}
}

void find(int now){
	int to;
	for (int i = head[now]; i != -1; i = node[i].next){
		to = node[i].to;
		if (t[to] == now){
			find(to);
			a[now] += a[to];
			e[now] += e[to];
		}
	}
}

void gao(int now){
	int to, id;
	for (int i = head[now]; i != -1; i = node[i].next){
		to = node[i].to;
		id = node[i].id;
		if (t[to] == now){
			ex[id] = e[to];
			gao(to);
		}
	}
}

void add(int x, int y, int id){
	node[use].to = y;
	node[use].id = id;
	node[use].next = head[x];
	head[x] = use++;
	node[use].to = x;
	node[use].id = id;
	node[use].next = head[y];
	head[y] = use++;
}

int main(){
	//read;
	//write;
	init();
	int T;
	cin >> T;
	for (int tt = 1; tt <= T; tt++){
		//cin >> n >> m;
		SS(n); SS(m);
		for (int i = 0; i <= n; i++){
			a[i] = e[i] = 0;
		}
		use = 0;
		for (int i = 1; i <= n; i++){
			head[i] = -1;
		}
		int now, to;
		for (int i = 1; i <= n - 1; i++){
			//    cin >> now >> to;
			SS(now); SS(to);
			add(now, to, i);
		}
		start();
		char s[8];
		int x, y, z, temp;
		for (int i = 1; i <= m; i++){
			scanf("%s %d %d %d", s, &x, &y, &temp);
			//    cin >> s >> x >> y >> temp;
			z = lca(x, y);
			if (s[3] == '1'){
				a[x] += temp;
				a[y] += temp;
				a[z] -= temp;
				a[t[z]] -= temp;
			}
			else{
				e[x] += temp;
				e[y] += temp;
				e[z] -= 2 * temp;
			}
		}
		find(1);
		gao(1);
		printf("Case #%d:\n", tt);
		for (int i = 1; i < n; i++){
			printf("%I64d ", a[i]);
		}
		printf("%I64d\n", a[n]);
		for (int i = 1; i <= n - 1; i++){
			if (i != n - 1)printf("%I64d ", ex[i]);
			else printf("%I64d", ex[i]);
		}
		puts("");
	}
	return 0;
}