neu1132（增量最小生成树，两点之间的最大边权）

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<math.h>
#include<vector>
#include<cstring>
#include<string>

#define N 1005
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
#define eps 10e-6
using namespace std;
struct node
{
    int u,cost;
};
vector<node> G
;
int dist

,vis
;
void dfs(int k,int cur,int cost)//求任意两点间的最大边权
{
    vis[cur] = 1;
    int len = G[cur].size();
    int i;
    for(i = 0; i < len; i++)
        if(!vis[ G[cur][i].u ])
        {
            dist[k][ G[cur][i].u ] = max(dist[k][ G[cur][i].u ], max(cost,G[cur][i].cost) );
            dfs(k,G[cur][i].u, max(cost,G[cur][i].cost) );
        }
}
int main()
{
    int n,cas = 1;
    while(scanf("%d",&n) != EOF)
    {
        int i,j,sum = 0;
        for(i = 0; i <= n; i++)     G[i].clear();
        for(i = 1; i < n; i++)
        {
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            node temp;
            temp.cost = w;
            temp.u = v;
            G[u].push_back(temp);
            temp.u = u;
            G[v].push_back(temp);
            sum+=w;
        }
        memset(dist,0,sizeof(dist));
        for(i = 1; i <= n; i++)
        {
            memset(vis,0,sizeof(vis));
            vis[i] = 1;
            dfs(i,i,0);
        }
        int q;
        printf("Test #%d\n",cas++);
        scanf("%d",&q);
        while(q--)
        {
            int x,y,w;
            scanf("%d%d%d",&x,&y,&w);
            int ans = sum - dist[x][y] + min(dist[x][y],w);
            printf("%d\n",ans);
        }
    }
    return 0;
}