How ABC E

#include<iostream>
#include<algorithm>
using namespace std;
const int N=10;
const int M=100;
int n,m,cnt;
struct Edge{ 
	int from,to;
	long long value;
}edge[M];
int fa[N];
long long mod,ans;
int find(int x){ 
	return x==fa[x]?x:fa[x]=find(fa[x]);
} 
bool cmp(Edge x,Edge y){
	return x.value<y.value;
} 
void kruskal(){
	sort(edge+1,edge+m+1,cmp); 
	for(int i=1;i<=m;i++){
        int u=find(edge[i].from),v=find(edge[i].to);
        if(fa[u]==fa[v]){
            continue;
        }
        ans+=edge[i].value; ans%=mod;
        fa[v]=u; 
        if(++cnt==n-1){ 
            break;
        }
    }
} 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin>>n>>m>>mod;
	for(int i=1;i<=n;i++){  
		fa[i]=i;
	}
	for(int i=1;i<=m;i++){
		cin>>edge[i].from>>edge[i].to>>edge[i].value;
	} 
	kruskal();
	cout<<ans;
return 0;
}