<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with weighted edges [(0, 1, 2), (0, 2, 2), (1, 2, 1), (2, 1, 1), (2, 3, 1), (3, 0, 1)], use the minimum_spanning_arborescence function from NetworkX to compute the minimum spanning arborescence, where weights denote the cost to traverse from one node to another. The 'preserve_attrs' parameter is set to False, meaning we are not interested in preserving edge attributes other than the weight.
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()
# Add weighted edges
G.add_weighted_edges_from([(0, 1, 2), (0, 2, 2), (1, 2, 1), (2, 1, 1), (2, 3, 1), (3, 0, 1)])

# Compute the minimum spanning arborescence
try:
    arborescence = nx.minimum_spanning_arborescence(G, attr='weight', preserve_attrs=False)
    print(nx.info(arborescence))
except nx.NetworkXException as e:
    print(e)
<|EOT|>
