#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<cmath>

 #include<algorithm>

 #include<queue>

 #include<vector>

 #include<map>

 #include<set>

 #define ll long long

 #define inf 2139062143

 #define MAXN 400100

 #define MOD 998244353

 #define rep(i,s,t) for(register int i=(s),i##__end=(t);i<=i##__end;++i)

 #define dwn(i,s,t) for(register int i=(s),i##__end=(t);i>=i##__end;--i)

 #define ren for(register int i=fst[x];i;i=nxt[i])

 #define pb(i,x) vec[i].push_back(x)

 #define pls(a,b) (a+b)%MOD

 #define mns(a,b) (a-b+MOD)%MOD

 #define mul(a,b) (1LL*(a)*(b))%MOD

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(!isdigit(ch)) {if(ch=='-') f=-;ch=getchar();}

     while(isdigit(ch)) {x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 int n,m,fst[MAXN],nxt[MAXN<<],to[MAXN<<],t[MAXN],val[MAXN];

 int sz[MAXN],hvs[MAXN],cnt,num[MAXN],ans[MAXN],res[MAXN],tmp;

 void add(int u,int v) {nxt[++cnt]=fst[u],fst[u]=cnt,to[cnt]=v;}

 void dfs(int x,int pa)

 {

     sz[x]=;ren if(to[i]^pa)

     {

         dfs(to[i],x),sz[x]+=sz[to[i]];

         if(sz[to[i]]>sz[hvs[x]]) hvs[x]=to[i];

     }

 }

 void cheq(int &x,int y) {x=(num[y]>num[x]||(num[x]==num[y]&&y<x))?y:x;}

 void Get(int x,int pa,int v)

 {

     num[t[x]]+=v*val[x];if(v>) cheq(tmp,t[x]);

     ren if(to[i]^pa) Get(to[i],x,v);

 }

 void dsu(int x,int pa,int v)

 {

     ren if(to[i]^pa&&to[i]^hvs[x]) dsu(to[i],x,);

     if(hvs[x]) dsu(hvs[x],x,);

     ren if(to[i]^pa&&to[i]^hvs[x]) Get(to[i],x,);

     num[t[x]]+=val[x];cheq(tmp,t[x]);ans[x]=tmp,res[x]=num[tmp];

     if(!v) tmp=,Get(x,pa,-);

 }

 int main()

 {

     n=read(),m=read();int a,b;rep(i,,n) a=read(),b=read(),add(a,b),add(b,a);

     rep(i,,n) t[i]=read(),val[i]=read();

     dfs(,);dsu(,,);rep(i,,n) printf("%d %d\n",ans[i],res[i]);

 }