<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph whose edge set is [('A', 'B', 3), ('A', 'C', 2), ('B', 'C', 5), ('C', 'A', 10), ('C', 'B', 1)], how can you compute the minimum spanning arborescence using NetworkX, considering the weights of the edges?
### Response:
import networkx as nx
from networkx import minimum_spanning_arborescence

# Create a directed graph
G = nx.DiGraph()
G.add_weighted_edges_from([('A', 'B', 3), ('A', 'C', 2), ('B', 'C', 5), ('C', 'A', 10), ('C', 'B', 1)])

# Find the minimum spanning arborescence
M = minimum_spanning_arborescence(G, attr='weight', default=1, preserve_attrs=False)

print(M.edges(data=True))
<|EOT|>
