【题目链接】http://www.lydsy.com/JudgeOnline/problem.php?id=1060
【呆马】
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<iostream>
#define ll long long
const int N=500001;
using namespace std;
struct st{int to,next;ll v;} e[N<<1];
int n,cnt,i,root,x,y,fi[N];
ll z,ans,f[N];
void add(int x,int y,ll z)
{
e[++cnt].to=y; e[cnt].next=fi[x]; e[cnt].v=z; fi[x]=cnt;
e[++cnt].to=x; e[cnt].next=fi[y]; e[cnt].v=z; fi[y]=cnt;
}
void dfs(int x,int fa)
{
ll num=0;
for (int y,i=fi[x];i;i=e[i].next)
if (e[i].to!=fa)
{
dfs(y=e[i].to,x);
f[y]+=e[i].v;
if (f[y]>f[x]) ans+=num*(f[y]-f[x]),f[x]=f[y];
else ans+=f[x]-f[y];
num++;
}
}
int main()
{
scanf("%d\n%d\n",&n,&root);
for (i=1;i<n;i++)
{
scanf("%d%d%lld\n",&x,&y,&z);
add(x,y,z);
}
dfs(root,0);
printf("%lld",ans);
}