3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
const int N = 2e5 + 10;
int n;
std::vector<std::pair<int, double> > edge[N];
bool vis[N];
double weight[N];
std::pair<int, double> ans;
int size[N], best[N];
double cost[N], der[N];
void init() {
  std::cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%lf", &weight[i]);
  }
  for (int i = 1; i <= n - 1; i++) {
    int u, v;
    double w;
    scanf("%d%d%lf", &u, &v, &w);
    edge[u].push_back(std::make_pair(v, w));
    edge[v].push_back(std::make_pair(u, w));
  }
}
void dfs(int u, int father, double deep, std::vector<int> &queue) {
  queue.push_back(u);
  size[u] = 1;
  best[u] = 0;
  for (int i = 0; i < (int)edge[u].size(); i++) {
    int v = edge[u][i].first;
    if (vis[v] || v == father) {
      continue;
    }
    dfs(v, u, deep + edge[u][i].second, queue);
    size[u] += size[v];
    best[u] = std::max(best[u], size[v]);
    der[u] += der[v];
  }
}
int get_center(int root, const std::vector<int> &queue) {
  int total = size[root];
  int ret = 0;
  int tmp = n + 5;
  for (int i = 0; i < (int)queue.size(); i++) {
    int u = queue[i];
    best[u] = std::max(best[u], total - size[u]);
    if (best[u] < tmp) {
      tmp = best[u];
      ret = u;
    }
  }
  return ret;
}
void dfs_all(int u, int father, double deep) {
  cost[u] = deep * std::sqrt(deep) * weight[u];
  der[u] = sqrt(deep) * weight[u];
  for (int i = 0; i < (int)edge[u].size(); i++) {
    int v = edge[u][i].first;
    if (v == father) {
      continue;
    }
    dfs_all(v, u, deep + edge[u][i].second);
    der[u] += der[v];
  }
}
void update(int u) {
  double total_cost = 0.0;
  for (int i = 1; i <= n; i++) {
    total_cost += cost[i];
  }
  if (ans.first == 0 || total_cost < ans.second) {
    ans = std::make_pair(u, total_cost);
  }
}
int get_direction(int u, const std::vector<int> &queue) {
  double max = -1.0;
  int ret = -1;
  for (int i = 0; i < (int)edge[u].size(); i++) {
    if (vis[edge[u][i].first]) {
      continue;
    }
    int v = edge[u][i].first;
    if (der[v] > max) {
      max = der[v];
      ret = v;
    }
  }
  return ret;
}
void work() {
  int root = 1;
  while (true) {
    static std::vector<int> queue;
    queue.clear();
    dfs(root, 0, 0.0, queue);
    int center = get_center(root, queue);
    queue.clear();
    dfs_all(center, 0, 0.0);
    root = get_direction(center, queue);
    update(center);
    vis[center] = true;
    if (root == -1) {
      break;
    }
  }
  if (ans.first == 0) {
    ans.first = 1;
  }
  printf("%d %.8f\n", ans.first, ans.second);
}
int main() {
  init();
  work();
  return 0;
}
