<｜begin▁of▁sentence｜>### Instruction:
Given a graph with weighted edges [('A', 'B', 5), ('A', 'C', 3), ('B', 'C', 1), ('B', 'D', 4)], how to find the maximum weight clique using NetworkX?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()

# Add weighted edges
G.add_weighted_edges_from([("A", "B", 5), ("A", "C", 3), ("B", "C", 1), ("B", "D", 4)])

# Find a maximum weight clique
clique, weight = nx.algorithms.clique.max_weight_clique(G, weight='weight')

print('Maximum weight clique:', clique)
print('With weight:', weight)
<|EOT|>
