#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int maxn=10000+1;
struct node
{
	long int father,w;
}a[maxn];
long int m,n,x,y,z;
long int ans,time,temp;
int main()
{
	freopen ("diaoyu.in","r",stdin);
	freopen ("diaoyu.out","w",stdout);
	
	cin>>n>>m;
	for (int i=1; i<n; i++)
	{
		scanf ("%ld%ld%ld",&x,&y,&z);
		a[y].father=x;a[y].w=z;
	}
	while (m--)
	{
		cin>>x>>y; temp=time;
		while (a[y].father && y!=x)
		{
			time+=a[y].w;
			y=a[y].father;
		}
		if (!a[y].father) time=temp;
		else ans++;
	}
	cout<<ans<<endl<<time<<endl;
	return 0;
}