#include<cstdio>
#include<iostream>
#include<vector>
#define MAXN 10001
using namespace std;
typedef unsigned long long ull;
int n,m;
ull ans=0;
ull sum=0;
struct Edge
{
	int to,w;
	Edge(int v,int d):to(v),w(d){}
};
vector<Edge>G[MAXN];
inline void AddEdge(int u,int v,int w)
{
	G[u].push_back(Edge(v,w));
}
inline bool dfs(int cur,int end)
{
	if(cur==end)
	{
		ans++;
		return true;
	}
	if(G[cur].size()==0)
	{
		return false;
	}
	for(int i=0;i<G[cur].size();i++)
	{
		int v=G[cur][i].to;
		int w=G[cur][i].w;
		if(dfs(v,end))
		{
			sum+=w;
		}
	}
	return true;
}
int main()
{
	freopen("diaoyu.in","r",stdin);
	freopen("diaoyu.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n-1;i++)
	{
		int u,v,w;
		cin>>u>>v>>w;
		AddEdge(u,v,w);
	}
	for(int i=1;i<=m;i++)
	{
		int u,v;
		cin>>u>>v;
		if(u==v)
		continue;
		dfs(u,v);
	} 
	cout<<ans<<endl;
	cout<<sum<<endl;
	return 0;
}