#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
struct edge{
int x,y,v;
}e[100010];
int n,p,cnt,ans,mn=99999999,a[10010],fa[10010];
int find(int x){if(fa[x]!=x)fa[x]=find(fa[x]);return fa[x];}
inline bool cmp(edge x,edge y){return x.v&l......
阅读全文